{"id":"https://openalex.org/W2086832561","doi":"https://doi.org/10.1007/bf02680570","title":"L-shaped decomposition of two-stage stochastic programs with integer recourse","display_name":"L-shaped decomposition of two-stage stochastic programs with integer recourse","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2086832561","doi":"https://doi.org/10.1007/bf02680570","mag":"2086832561"},"language":"en","primary_location":{"id":"doi:10.1007/bf02680570","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02680570","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/A5003087627","display_name":"Claus C. Car\u00f8e","orcid":null},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Claus C. Car\u00f8e","raw_affiliation_strings":["Department of Operations Research, University of Copenhagen, Universitetsparken 5, DK-2100, Copenhagen \u00d8, Denmark","Department of Operations Research, University of Copenhagen, Copenhagen \u00d8, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Operations Research, University of Copenhagen, Universitetsparken 5, DK-2100, Copenhagen \u00d8, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"Department of Operations Research, University of Copenhagen, Copenhagen \u00d8, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109486816","display_name":"J\u00f8rgen Tind","orcid":null},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"J\u00f8rgen Tind","raw_affiliation_strings":["Department of Operations Research, University of Copenhagen, Universitetsparken 5, DK-2100, Copenhagen \u00d8, Denmark","Department of Operations Research, University of Copenhagen, Copenhagen \u00d8, Denmark"],"affiliations":[{"raw_affiliation_string":"Department of Operations Research, University of Copenhagen, Universitetsparken 5, DK-2100, Copenhagen \u00d8, Denmark","institution_ids":["https://openalex.org/I124055696"]},{"raw_affiliation_string":"Department of Operations Research, University of Copenhagen, Copenhagen \u00d8, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003087627"],"corresponding_institution_ids":["https://openalex.org/I124055696"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":6.4748,"has_fulltext":false,"cited_by_count":204,"citation_normalized_percentile":{"value":0.9680554,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"83","issue":"1-3","first_page":"451","last_page":"464"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9973000288009644,"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.9973000288009644,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.993399977684021,"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"}},{"id":"https://openalex.org/T12137","display_name":"Economic theories and models","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.8253986239433289},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8021334409713745},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.6919829845428467},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6771715879440308},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6183052062988281},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6107210516929626},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.5890807509422302},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5671351552009583},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5040675401687622},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.49015864729881287},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.48536956310272217},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4607388377189636},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.43727362155914307},{"id":"https://openalex.org/keywords/stage","display_name":"Stage (stratigraphy)","score":0.42758601903915405},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.4125176668167114},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.3463318645954132},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.25932633876800537},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.12611538171768188}],"concepts":[{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.8253986239433289},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8021334409713745},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.6919829845428467},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6771715879440308},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6183052062988281},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6107210516929626},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.5890807509422302},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5671351552009583},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5040675401687622},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.49015864729881287},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.48536956310272217},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4607388377189636},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.43727362155914307},{"id":"https://openalex.org/C146357865","wikidata":"https://www.wikidata.org/wiki/Q1123245","display_name":"Stage (stratigraphy)","level":2,"score":0.42758601903915405},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.4125176668167114},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.3463318645954132},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25932633876800537},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.12611538171768188},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/bf02680570","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02680570","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.15.6057","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.6057","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.ku.dk/~caroe/dvi_html/lshaped2.ps","raw_type":"text"},{"id":"pmh:oai:ddd.uab.cat:168","is_oa":false,"landing_page_url":"https://ddd.uab.cat/record/168","pdf_url":null,"source":{"id":"https://openalex.org/S4306400380","display_name":"Dip\u00f2sit Digital de Documents de la UAB (Universitat Aut\u00f2noma de Barcelona)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I123044942","host_organization_name":"Universitat Aut\u00f2noma de Barcelona","host_organization_lineage":["https://openalex.org/I123044942"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/30bb03e0-74ca-11db-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://curis.ku.dk/portal/da/publications/lshaped-decomposition-of-twostage-stochastic-programs-with-integer-recourse(30bb03e0-74ca-11db-bee9-02004c4f4f50).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Car\u00f8e , C C & Tind , J 1998 , ' L-shaped decomposition of two-stage stochastic programs with integer recourse ' , Mathematical Programming , vol. 83 , pp. 451-464 .","raw_type":"article"},{"id":"pmh:oai:pure.atira.dk:publications/30bb03e0-74ca-11db-bee9-02004c4f4f50","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/30bb03e0-74ca-11db-bee9-02004c4f4f50","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Car\u00f8e , C C & Tind , J 1998 , ' L-shaped decomposition of two-stage stochastic programs with integer recourse ' , Mathematical Programming , vol. 83 , pp. 451-464 .","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1710856248","https://openalex.org/W1968143987","https://openalex.org/W1978701215","https://openalex.org/W1984647185","https://openalex.org/W2008131758","https://openalex.org/W2038426159","https://openalex.org/W2038560755","https://openalex.org/W2068913356","https://openalex.org/W2080875922","https://openalex.org/W2100387313","https://openalex.org/W2154920280","https://openalex.org/W2166009425","https://openalex.org/W2505968561"],"related_works":["https://openalex.org/W3006617646","https://openalex.org/W4210880521","https://openalex.org/W2158503982","https://openalex.org/W4230854124","https://openalex.org/W2263874601","https://openalex.org/W2387389269","https://openalex.org/W1575006176","https://openalex.org/W2379672298","https://openalex.org/W3009832451","https://openalex.org/W2110818895"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}