{"id":"https://openalex.org/W566649947","doi":"https://doi.org/10.1007/s13675-015-0038-7","title":"Solving multistage quantified linear optimization problems with the alpha\u2013beta nested Benders decomposition","display_name":"Solving multistage quantified linear optimization problems with the alpha\u2013beta nested Benders decomposition","publication_year":2015,"publication_date":"2015-05-08","ids":{"openalex":"https://openalex.org/W566649947","doi":"https://doi.org/10.1007/s13675-015-0038-7","mag":"566649947"},"language":"en","primary_location":{"id":"doi:10.1007/s13675-015-0038-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-015-0038-7","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"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":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1007/s13675-015-0038-7","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109720009","display_name":"Ulf Lorenz","orcid":null},"institutions":[{"id":"https://openalex.org/I206895457","display_name":"University of Siegen","ror":"https://ror.org/02azyry73","country_code":"DE","type":"education","lineage":["https://openalex.org/I206895457"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ulf Lorenz","raw_affiliation_strings":["Technology Management, Universit\u00e4t Siegen, H\u00f6lderlinstr. 3, Siegen, Germany","UNIVERSITAT SIEGEN"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technology Management, Universit\u00e4t Siegen, H\u00f6lderlinstr. 3, Siegen, Germany","institution_ids":["https://openalex.org/I206895457"]},{"raw_affiliation_string":"UNIVERSITAT SIEGEN","institution_ids":["https://openalex.org/I206895457"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011549740","display_name":"Jan Wolf","orcid":"https://orcid.org/0009-0009-7372-7458"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jan Wolf","raw_affiliation_strings":["Institute of Mathematics, Technische Universit\u00e4t Darmstadt, Dolivostr. 15, Darmstadt, Germany","Technische Universit\u00e4t Darmstadt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, Technische Universit\u00e4t Darmstadt, Dolivostr. 15, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]},{"raw_affiliation_string":"Technische Universit\u00e4t Darmstadt","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011549740"],"corresponding_institution_ids":["https://openalex.org/I31512782"],"apc_list":{"value":1400,"currency":"USD","value_usd":1400},"apc_paid":{"value":1400,"currency":"USD","value_usd":1400},"fwci":0.8902,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.78369945,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"3","issue":"4","first_page":"349","last_page":"370"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9968000054359436,"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"}},"topics":[{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9968000054359436,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9901999831199646,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.984000027179718,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.633890688419342},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.5912531614303589},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.542375922203064},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5235421657562256},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5131993889808655},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4489901065826416},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4347781240940094},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43026962876319885},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13345590233802795}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.633890688419342},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.5912531614303589},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.542375922203064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5235421657562256},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5131993889808655},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4489901065826416},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4347781240940094},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43026962876319885},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13345590233802795},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s13675-015-0038-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-015-0038-7","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"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":"EURO Journal on Computational Optimization","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:5b08a36d74fd4e89b12c632614eefe02","is_oa":true,"landing_page_url":"https://doaj.org/article/5b08a36d74fd4e89b12c632614eefe02","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"EURO Journal on Computational Optimization, Vol 3, Iss 4, Pp 349-370 (2015)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s13675-015-0038-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-015-0038-7","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"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":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.699999988079071}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W229300124","https://openalex.org/W269783864","https://openalex.org/W1481283420","https://openalex.org/W1503391522","https://openalex.org/W1521425323","https://openalex.org/W1569990960","https://openalex.org/W1583189441","https://openalex.org/W1636491287","https://openalex.org/W1964867441","https://openalex.org/W1969007958","https://openalex.org/W1974114807","https://openalex.org/W1975387421","https://openalex.org/W1983916623","https://openalex.org/W1984647185","https://openalex.org/W2003777645","https://openalex.org/W2006093909","https://openalex.org/W2016461703","https://openalex.org/W2019851160","https://openalex.org/W2034752994","https://openalex.org/W2044121814","https://openalex.org/W2049606892","https://openalex.org/W2084805084","https://openalex.org/W2093704185","https://openalex.org/W2108658657","https://openalex.org/W2116509768","https://openalex.org/W2154273872","https://openalex.org/W2157803532","https://openalex.org/W2341171179","https://openalex.org/W2597548739","https://openalex.org/W3104705157","https://openalex.org/W3123150049"],"related_works":["https://openalex.org/W2016058626","https://openalex.org/W2474724840","https://openalex.org/W2895916002","https://openalex.org/W1530911128","https://openalex.org/W1814049089","https://openalex.org/W2369683208","https://openalex.org/W2084836983","https://openalex.org/W1977348009","https://openalex.org/W2362133437","https://openalex.org/W2074145420"],"abstract_inverted_index":{"Quantified":[0],"linear":[1,5,109],"programs":[2,6],"(QLPs)":[3],"are":[4,16,44,139],"with":[7,112],"variables":[8],"being":[9],"either":[10],"existentially":[11],"or":[12],"universally":[13,60],"quantified.":[14],"QLPs":[15,43],"convex":[17],"multistage":[18],"decision":[19,88],"problems":[20],"on":[21,36,57],"the":[22,37,49,63,69,83,86,96,103,126,132],"one":[23,76],"side,":[24],"and":[25,32,107,134],"two-person":[26],"zero-sum":[27],"games":[28],"between":[29],"an":[30,91,123,166],"existential":[31,50],"a":[33,73,119],"universal":[34,64],"player":[35,51,65],"other":[38],"side.":[39],"Solutions":[40],"of":[41,59,85,125],"feasible":[42],"so-called":[45],"winning":[46,79],"strategies":[47],"for":[48],"that":[52,138],"specify":[53],"how":[54],"to":[55,66,145],"react":[56],"moves\u2014fixations":[58],"quantified":[61],"variables\u2014of":[62],"certainly":[67],"win":[68],"game.":[70],"To":[71,94],"find":[72],"certain":[74],"best":[75],"among":[77],"different":[78],"strategies,":[80],"we":[81,101,121],"propose":[82],"extension":[84,124],"QLP":[87,98,155],"problem":[89],"by":[90,131,158],"objective":[92],"function.":[93],"solve":[95,146],"resulting":[97],"optimization":[99],"problem,":[100],"exploit":[102,151],"problem\u2019s":[104],"hybrid":[105],"nature":[106],"combine":[108],"programming":[110],"techniques":[111,114,137],"solution":[113,152],"from":[115,154],"game-tree":[116,143],"search.":[117],"As":[118],"result,":[120],"present":[122],"nested":[127],"Benders":[128],"decomposition":[129],"algorithm":[130],"\u03b1\u03b2-heuristic":[133],"move-ordering,":[135],"two":[136],"successfully":[140],"used":[141],"in":[142,165],"search":[144],"minimax":[147],"trees.":[148],"We":[149],"furthermore":[150],"information":[153],"relaxations":[156],"obtained":[157],"quantifier":[159],"shifting.":[160],"The":[161],"applicability":[162],"is":[163],"examined":[164],"experimental":[167],"evaluation.":[168]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}