{"id":"https://openalex.org/W4390586831","doi":"https://doi.org/10.1007/s00186-023-00847-8","title":"An outer approximation algorithm for generating the Edgeworth\u2013Pareto hull of multi-objective mixed-integer linear programming problems","display_name":"An outer approximation algorithm for generating the Edgeworth\u2013Pareto hull of multi-objective mixed-integer linear programming problems","publication_year":2024,"publication_date":"2024-01-04","ids":{"openalex":"https://openalex.org/W4390586831","doi":"https://doi.org/10.1007/s00186-023-00847-8"},"language":"en","primary_location":{"id":"doi:10.1007/s00186-023-00847-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00186-023-00847-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00186-023-00847-8.pdf","source":{"id":"https://openalex.org/S126160977","display_name":"Mathematical Methods of Operations Research","issn_l":"1432-2994","issn":["1432-2994","1432-5217"],"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 Methods of Operations Research","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/s00186-023-00847-8.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079504828","display_name":"Fritz B\u00f6kler","orcid":"https://orcid.org/0000-0002-7950-6965"},"institutions":[{"id":"https://openalex.org/I170658231","display_name":"Osnabr\u00fcck University","ror":"https://ror.org/04qmmjx98","country_code":"DE","type":"education","lineage":["https://openalex.org/I170658231"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Fritz B\u00f6kler","raw_affiliation_strings":["Institute of Computer Science, Osnabr\u00fcck University, Osnabr\u00fcck, Germany"],"raw_orcid":"https://orcid.org/0000-0002-7950-6965","affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Osnabr\u00fcck University, Osnabr\u00fcck, Germany","institution_ids":["https://openalex.org/I170658231"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037046189","display_name":"Sophie N. Parragh","orcid":"https://orcid.org/0000-0002-7428-9770"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Sophie N. Parragh","raw_affiliation_strings":["Institute of Production and Logistics Management/JKU Business School, Johannes Kepler University Linz, Linz, Austria"],"raw_orcid":"https://orcid.org/0000-0002-7428-9770","affiliations":[{"raw_affiliation_string":"Institute of Production and Logistics Management/JKU Business School, Johannes Kepler University Linz, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030387525","display_name":"Markus Sinnl","orcid":"https://orcid.org/0000-0003-1439-8702"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Markus Sinnl","raw_affiliation_strings":["Institute of Business Analytics and Technology Transformation/JKU Business School, Johannes Kepler University Linz, Linz, Austria"],"raw_orcid":"https://orcid.org/0000-0003-1439-8702","affiliations":[{"raw_affiliation_string":"Institute of Business Analytics and Technology Transformation/JKU Business School, Johannes Kepler University Linz, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026344649","display_name":"Fabien Tricoire","orcid":"https://orcid.org/0000-0002-3700-5134"},"institutions":[{"id":"https://openalex.org/I102248843","display_name":"Vienna University of Economics and Business","ror":"https://ror.org/03yn8s215","country_code":"AT","type":"education","lineage":["https://openalex.org/I102248843"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Fabien Tricoire","raw_affiliation_strings":["Institute for Transport and Logistics Management, Vienna University of Economics and Business, Vienna, Austria"],"raw_orcid":"https://orcid.org/0000-0002-3700-5134","affiliations":[{"raw_affiliation_string":"Institute for Transport and Logistics Management, Vienna University of Economics and Business, Vienna, Austria","institution_ids":["https://openalex.org/I102248843"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030387525"],"corresponding_institution_ids":["https://openalex.org/I121883995"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":1.2818,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79751505,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"100","issue":"1","first_page":"263","last_page":"290"},"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.9993000030517578,"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.9993000030517578,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9986000061035156,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/extreme-point","display_name":"Extreme point","score":0.7818425893783569},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6356073021888733},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5347415804862976},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5186980962753296},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.5117775797843933},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5076707601547241},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5021998882293701},{"id":"https://openalex.org/keywords/hull","display_name":"Hull","score":0.4863598942756653},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4773155152797699},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45532041788101196},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.4264557361602783},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41006630659103394},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32007741928100586},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2610135078430176},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.22486808896064758}],"concepts":[{"id":"https://openalex.org/C39847760","wikidata":"https://www.wikidata.org/wiki/Q1385465","display_name":"Extreme point","level":2,"score":0.7818425893783569},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6356073021888733},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5347415804862976},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5186980962753296},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.5117775797843933},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5076707601547241},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5021998882293701},{"id":"https://openalex.org/C37423430","wikidata":"https://www.wikidata.org/wiki/Q6750281","display_name":"Hull","level":2,"score":0.4863598942756653},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4773155152797699},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45532041788101196},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.4264557361602783},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41006630659103394},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32007741928100586},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2610135078430176},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.22486808896064758},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199104240","wikidata":"https://www.wikidata.org/wiki/Q118291","display_name":"Marine engineering","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00186-023-00847-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00186-023-00847-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00186-023-00847-8.pdf","source":{"id":"https://openalex.org/S126160977","display_name":"Mathematical Methods of Operations Research","issn_l":"1432-2994","issn":["1432-2994","1432-5217"],"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 Methods of Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:econstor.eu:10419/317040","is_oa":true,"landing_page_url":"https://hdl.handle.net/10419/317040","pdf_url":"https://www.econstor.eu/bitstream/10419/317040/1/00186_2023_Article_847.pdf","source":{"id":"https://openalex.org/S4306401696","display_name":"Econstor (Econstor)","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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doc-type:article"},{"id":"pmh:oai:epub.jku.at/:9526828","is_oa":true,"landing_page_url":"https://epub.jku.at/doi/10.1007/s00186-023-00847-8","pdf_url":"https://epub.jku.at/obvulioa/content/titleinfo/9526828/full.pdf","source":{"id":"https://openalex.org/S4306401788","display_name":"University Library Linz repository (Johannes Kepler Universitat Linz)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I121883995","host_organization_name":"Johannes Kepler University of Linz","host_organization_lineage":["https://openalex.org/I121883995"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:RePEc:spr:mathme:v:100:y:2024:i:1:d:10.1007_s00186-023-00847-8","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s00186-023-00847-8","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s00186-023-00847-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00186-023-00847-8","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00186-023-00847-8.pdf","source":{"id":"https://openalex.org/S126160977","display_name":"Mathematical Methods of Operations Research","issn_l":"1432-2994","issn":["1432-2994","1432-5217"],"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 Methods of Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G2558644613","display_name":null,"funder_award_id":"P 31366","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4390586831.pdf"},"referenced_works_count":54,"referenced_works":["https://openalex.org/W251973404","https://openalex.org/W427674437","https://openalex.org/W930342000","https://openalex.org/W1483431698","https://openalex.org/W1561610472","https://openalex.org/W1586016561","https://openalex.org/W1968876856","https://openalex.org/W1978090048","https://openalex.org/W1990023680","https://openalex.org/W2001490501","https://openalex.org/W2003264207","https://openalex.org/W2012902555","https://openalex.org/W2040075495","https://openalex.org/W2042818144","https://openalex.org/W2045560222","https://openalex.org/W2048944090","https://openalex.org/W2053375152","https://openalex.org/W2054299720","https://openalex.org/W2054372248","https://openalex.org/W2062873592","https://openalex.org/W2063549568","https://openalex.org/W2071676345","https://openalex.org/W2090839948","https://openalex.org/W2105630212","https://openalex.org/W2109785169","https://openalex.org/W2117522563","https://openalex.org/W2135369792","https://openalex.org/W2138131169","https://openalex.org/W2163936975","https://openalex.org/W2179308666","https://openalex.org/W2254347213","https://openalex.org/W2281047077","https://openalex.org/W2469713394","https://openalex.org/W2490736661","https://openalex.org/W2542433819","https://openalex.org/W2547264844","https://openalex.org/W2790266462","https://openalex.org/W2886005644","https://openalex.org/W2889871839","https://openalex.org/W2942148196","https://openalex.org/W2964996841","https://openalex.org/W2966382902","https://openalex.org/W3011677699","https://openalex.org/W3012502442","https://openalex.org/W3166072403","https://openalex.org/W4210268737","https://openalex.org/W4220712670","https://openalex.org/W4238163351","https://openalex.org/W4252242738","https://openalex.org/W4292542951","https://openalex.org/W4293860921","https://openalex.org/W4293879931","https://openalex.org/W4300568640","https://openalex.org/W4386626147"],"related_works":["https://openalex.org/W142701514","https://openalex.org/W2019069959","https://openalex.org/W2389339893","https://openalex.org/W1992352038","https://openalex.org/W2187510381","https://openalex.org/W21575339","https://openalex.org/W1989292700","https://openalex.org/W2121443275","https://openalex.org/W2955704176","https://openalex.org/W3047392848"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2,78],"paper,":[3],"we":[4,97],"present":[5],"an":[6,167],"outer":[7],"approximation":[8],"algorithm":[9,85,164,190,209,218,268],"for":[10,65,129,131,155,179,184,258],"computing":[11],"the":[12,24,28,33,36,46,60,71,82,100,109,114,118,124,133,141,156,189,208,217,226,234,239,245,259,267,270,285],"Edgeworth\u2013Pareto":[13,37,72],"hull":[14,73,116],"of":[15,35,51,62,74,103,111,113,117,126,158,207,233,238,262,281],"multi-objective":[16,66,176,263],"mixed-integer":[17],"linear":[18,67,264],"programming":[19,68,265],"problems":[20,69,95],"(MOMILPs).":[21],"It":[22],"produces":[23,220],"extreme":[25,43,47,119,159],"points":[26,44,50,122,247],"(i.e.,":[27,223],"vertices)":[29],"as":[30,32,187],"well":[31],"facets":[34,112,142,249],"hull.":[38],"We":[39,54],"note":[40],"that":[41,91,99,150],"these":[42],"are":[45],"supported":[48,120,160],"non-dominated":[49,121,161],"a":[52,88,193,210,236,252,279],"MOMILP.":[53],"also":[55,219],"show":[56,98],"how":[57],"to":[58,70,80,170,272],"extend":[59],"concept":[61],"geometric":[63],"duality":[64],"MOMILPs":[75,130],"and":[76,96,244,248],"use":[77],"extension":[79],"develop":[81],"algorithm.":[83],"The":[84],"relies":[86],"on":[87,278],"novel":[89],"oracle":[90,104],"solves":[92,269],"single-objective":[93],"weighted-sum":[94,134],"required":[101],"number":[102,110],"calls":[105],"is":[106,136,183,214,287],"polynomial":[107,139],"in":[108,123,138,225,230],"convex":[115],"case":[125,261],"MOMILPs.":[127,181],"Thus,":[128],"which":[132],"problem":[135,271],"solvable":[137],"time,":[140],"can":[143,165,241],"be":[144,166,242],"computed":[145],"with":[146],"incremental-polynomial":[147],"delay\u2014a":[148],"result":[149],"was":[151],"formerly":[152],"only":[153],"known":[154],"computation":[157],"points.":[162],"Our":[163],"attractive":[168],"option":[169],"compute":[171],"lower":[172,196,211,254],"bound":[173,197,212,255],"sets":[174],"within":[175],"branch-and-bound":[177],"algorithms":[178],"solving":[180],"This":[182],"several":[185],"reasons":[186],"(i)":[188],"starts":[191],"from":[192,284],"trivial":[194],"valid":[195,253],"set":[198,213,280],"then":[199],"iteratively":[200],"improves":[201],"it,":[202],"thus":[203],"at":[204],"any":[205,231],"iteration":[206,232],"available;":[215],"(ii)":[216],"efficient":[221],"solutions":[222,224],"decision":[227],"space);":[228],"(iii)":[229],"algorithm,":[235],"relaxation":[237],"MOMILP":[240],"solved,":[243],"obtained":[246],"still":[250],"provide":[251],"set.":[256],"Moreover,":[257],"special":[260],"problems,":[266],"global":[273],"optimality.":[274],"A":[275],"computational":[276],"study":[277],"benchmark":[282],"instances":[283],"literature":[286],"provided.":[288]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}