{"id":"https://openalex.org/W3084272360","doi":"https://doi.org/10.1007/s10107-020-01559-1","title":"A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models","display_name":"A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models","publication_year":2020,"publication_date":"2020-09-07","ids":{"openalex":"https://openalex.org/W3084272360","doi":"https://doi.org/10.1007/s10107-020-01559-1","mag":"3084272360"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-020-01559-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-020-01559-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01559-1.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01559-1.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040965770","display_name":"Niels van der Laan","orcid":"https://orcid.org/0000-0002-8045-4517"},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Niels van der Laan","raw_affiliation_strings":["Department of Operations, University of Groningen, P.O. Box 800, 9700 AV, Groningen, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-8045-4517","affiliations":[{"raw_affiliation_string":"Department of Operations, University of Groningen, P.O. Box 800, 9700 AV, Groningen, The Netherlands","institution_ids":["https://openalex.org/I169381384"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069714410","display_name":"Ward Romeijnders","orcid":"https://orcid.org/0000-0002-6918-5635"},"institutions":[{"id":"https://openalex.org/I169381384","display_name":"University of Groningen","ror":"https://ror.org/012p63287","country_code":"NL","type":"education","lineage":["https://openalex.org/I169381384"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Ward Romeijnders","raw_affiliation_strings":["Department of Operations, University of Groningen, P.O. Box 800, 9700 AV, Groningen, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Operations, University of Groningen, P.O. Box 800, 9700 AV, Groningen, The Netherlands","institution_ids":["https://openalex.org/I169381384"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040965770"],"corresponding_institution_ids":["https://openalex.org/I169381384"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2890},"fwci":1.0203,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.82147857,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"190","issue":"1-2","first_page":"761","last_page":"794"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.9915000200271606,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7249397039413452},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6211733818054199},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6112774610519409},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5650742053985596},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5102677345275879},{"id":"https://openalex.org/keywords/zero","display_name":"Zero (linguistics)","score":0.43739446997642517},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4322342276573181},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41851356625556946},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3937193751335144},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19956988096237183}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7249397039413452},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6211733818054199},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6112774610519409},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5650742053985596},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5102677345275879},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.43739446997642517},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4322342276573181},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41851356625556946},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3937193751335144},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19956988096237183},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10107-020-01559-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-020-01559-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01559-1.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:pure.rug.nl:openaire/92757fab-2349-4d5b-8bba-e2ab1e45b760","is_oa":true,"landing_page_url":"https://research.rug.nl/en/publications/92757fab-2349-4d5b-8bba-e2ab1e45b760","pdf_url":null,"source":{"id":"https://openalex.org/S4306400420","display_name":"University of Groningen research database (University of Groningen / Centre for Information Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169381384","host_organization_name":"University of Groningen","host_organization_lineage":["https://openalex.org/I169381384"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"van der Laan, N & Romeijnders, W 2021, 'A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models', Mathematical Programming, vol. 190, pp. 761\u2013794. https://doi.org/10.1007/s10107-020-01559-1","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/s10107-020-01559-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-020-01559-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01559-1.pdf","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7323714962","display_name":"Planning for the unknown. Towards optimal decisions under uncertainty.","funder_award_id":"451-17-034","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"},{"id":"https://openalex.org/G7877951576","display_name":null,"funder_award_id":"451-17-034 4043","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3084272360.pdf","grobid_xml":"https://content.openalex.org/works/W3084272360.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W229300124","https://openalex.org/W621154860","https://openalex.org/W1480364293","https://openalex.org/W1539454454","https://openalex.org/W1964974282","https://openalex.org/W1982737192","https://openalex.org/W1984647185","https://openalex.org/W1992181083","https://openalex.org/W1993748657","https://openalex.org/W2000953623","https://openalex.org/W2010032742","https://openalex.org/W2025652703","https://openalex.org/W2038426159","https://openalex.org/W2044121814","https://openalex.org/W2054110366","https://openalex.org/W2055427220","https://openalex.org/W2065803772","https://openalex.org/W2076635261","https://openalex.org/W2094721569","https://openalex.org/W2100387313","https://openalex.org/W2114723402","https://openalex.org/W2115207529","https://openalex.org/W2128369242","https://openalex.org/W2132197066","https://openalex.org/W2135791976","https://openalex.org/W2138067268","https://openalex.org/W2145157516","https://openalex.org/W2147911217","https://openalex.org/W2161218010","https://openalex.org/W2288276805","https://openalex.org/W2339696208","https://openalex.org/W2495956339","https://openalex.org/W2522056961","https://openalex.org/W2618489260","https://openalex.org/W2738145410","https://openalex.org/W2991962634"],"related_works":["https://openalex.org/W3013650182","https://openalex.org/W4249605382","https://openalex.org/W2383646825","https://openalex.org/W4313491656","https://openalex.org/W2989283631","https://openalex.org/W2371018915","https://openalex.org/W2354191502","https://openalex.org/W2800717388","https://openalex.org/W1972225038","https://openalex.org/W2080263745"],"abstract_inverted_index":{"Abstract":[0],"We":[1,96,114],"propose":[2],"a":[3,39],"new":[4],"class":[5],"of":[6,20,56,71,76,125,142],"convex":[7,22],"approximations":[8,23],"for":[9,33,146],"two-stage":[10],"mixed-integer":[11],"recourse":[12],"models,":[13],"the":[14,54,57,68,72,77,81,107,123,126,130],"so-called":[15],"generalized":[16],"alpha-approximations.":[17],"The":[18,83],"advantage":[19],"these":[21,90],"over":[24],"existing":[25,138],"ones":[26],"is":[27,132],"that":[28,44,65,116],"they":[29],"are":[30],"more":[31],"suitable":[32],"efficient":[34],"computations.":[35],"Indeed,":[36],"we":[37,60],"construct":[38],"loose":[40],"Benders":[41],"decomposition":[42],"algorithm":[43],"solves":[45],"large":[46,147],"problem":[47,148],"instances":[48,111],"in":[49,80,129,140],"reasonable":[50],"time.":[51],"To":[52],"guarantee":[53],"performance":[55],"resulting":[58],"solution,":[59],"derive":[61],"corresponding":[62],"error":[63,84],"bounds":[64,85],"depend":[66],"on":[67,102],"total":[69,91],"variations":[70,92],"probability":[73],"density":[74],"functions":[75],"random":[78,127],"variables":[79],"model.":[82],"converge":[86,93],"to":[87,94],"zero":[88],"if":[89,122],"zero.":[95],"empirically":[97],"assess":[98],"our":[99,117,135],"solution":[100],"method":[101,118,136],"several":[103],"test":[104],"instances,":[105],"including":[106],"SIZES":[108],"and":[109],"SSLP":[110],"from":[112],"SIPLIB.":[113],"show":[115],"finds":[119],"near-optimal":[120],"solutions":[121],"variability":[124],"parameters":[128],"model":[131],"large.":[133],"Moreover,":[134],"outperforms":[137],"methods":[139],"terms":[141],"computation":[143],"time,":[144],"especially":[145],"instances.":[149]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5}],"updated_date":"2026-06-05T09:01:59.212387","created_date":"2025-10-10T00:00:00"}