{"id":"https://openalex.org/W229300124","doi":"https://doi.org/10.1007/s10107-003-0445-z","title":"Stochastic programming with integer variables","display_name":"Stochastic programming with integer variables","publication_year":2003,"publication_date":"2003-07-01","ids":{"openalex":"https://openalex.org/W229300124","doi":"https://doi.org/10.1007/s10107-003-0445-z","mag":"229300124"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-003-0445-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-003-0445-z","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021741090","display_name":"R\u00fcdiger Schultz","orcid":null},"institutions":[{"id":"https://openalex.org/I62318514","display_name":"University of Duisburg-Essen","ror":"https://ror.org/04mz5ra38","country_code":"DE","type":"education","lineage":["https://openalex.org/I62318514"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"R\u00fcdiger Schultz","raw_affiliation_strings":["Institute of Mathematics, University Duisburg-Essen, Lotharstr. 65, D-47048 Duisburg, Germany, e-mail: schultz@math.uni-duisburg.de, , , , , , DE","Institute of Mathematics, University Duisburg-Essen, Lotharstr. 65, D-47048 Duisburg, Germany, e-mail: schultz@math.uni-duisburg.de, DE"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, University Duisburg-Essen, Lotharstr. 65, D-47048 Duisburg, Germany, e-mail: schultz@math.uni-duisburg.de, , , , , , DE","institution_ids":["https://openalex.org/I62318514"]},{"raw_affiliation_string":"Institute of Mathematics, University Duisburg-Essen, Lotharstr. 65, D-47048 Duisburg, Germany, e-mail: schultz@math.uni-duisburg.de, DE","institution_ids":["https://openalex.org/I62318514"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021741090"],"corresponding_institution_ids":["https://openalex.org/I62318514"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":9.6671,"has_fulltext":false,"cited_by_count":185,"citation_normalized_percentile":{"value":0.98158215,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"97","issue":"1","first_page":"285","last_page":"309"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.7830682396888733},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.7768756151199341},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.7331333160400391},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.6808377504348755},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6616421937942505},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.5698138475418091},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5685564279556274},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.5583281517028809},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.507443368434906},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4705500900745392},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.41837871074676514},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22751224040985107},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20069625973701477}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7830682396888733},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.7768756151199341},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.7331333160400391},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.6808377504348755},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6616421937942505},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.5698138475418091},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5685564279556274},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.5583281517028809},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.507443368434906},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4705500900745392},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.41837871074676514},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22751224040985107},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20069625973701477},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-003-0445-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-003-0445-z","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":54,"referenced_works":["https://openalex.org/W83501275","https://openalex.org/W570389583","https://openalex.org/W640121886","https://openalex.org/W1487077091","https://openalex.org/W1490757478","https://openalex.org/W1501922675","https://openalex.org/W1508957056","https://openalex.org/W1547497998","https://openalex.org/W1553361062","https://openalex.org/W1569990960","https://openalex.org/W1570901895","https://openalex.org/W1602210307","https://openalex.org/W1672088458","https://openalex.org/W1752958389","https://openalex.org/W1788645602","https://openalex.org/W1964934516","https://openalex.org/W1968143987","https://openalex.org/W1970193303","https://openalex.org/W1974114807","https://openalex.org/W1975656821","https://openalex.org/W1984302977","https://openalex.org/W1987420866","https://openalex.org/W1989077188","https://openalex.org/W1990083802","https://openalex.org/W1995670718","https://openalex.org/W1996228459","https://openalex.org/W1998522752","https://openalex.org/W2008276232","https://openalex.org/W2019291268","https://openalex.org/W2023482164","https://openalex.org/W2029881990","https://openalex.org/W2031451726","https://openalex.org/W2038426159","https://openalex.org/W2038560755","https://openalex.org/W2052160057","https://openalex.org/W2055427220","https://openalex.org/W2061272534","https://openalex.org/W2064073681","https://openalex.org/W2069313750","https://openalex.org/W2075451161","https://openalex.org/W2082991255","https://openalex.org/W2086832561","https://openalex.org/W2094721569","https://openalex.org/W2095614010","https://openalex.org/W2100387313","https://openalex.org/W2109277200","https://openalex.org/W2126419180","https://openalex.org/W2154034653","https://openalex.org/W2490166021","https://openalex.org/W2618489260","https://openalex.org/W2798344481","https://openalex.org/W3106992008","https://openalex.org/W3121356820","https://openalex.org/W3124407081"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W2769220156","https://openalex.org/W4252122881","https://openalex.org/W3006617646","https://openalex.org/W4210880521","https://openalex.org/W134055995","https://openalex.org/W2110818895","https://openalex.org/W2979455991","https://openalex.org/W1872737999","https://openalex.org/W2390148480"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":10}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}