{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T17:39:48Z","timestamp":1770831588910,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T00:00:00Z","timestamp":1705017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T00:00:00Z","timestamp":1705017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s00186-023-00843-y","type":"journal-article","created":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T14:02:17Z","timestamp":1705068137000},"page":"221-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A fast and robust algorithm for solving biobjective mixed integer programs"],"prefix":"10.1007","volume":"100","author":[{"given":"Diego","family":"Pecin","sequence":"first","affiliation":[]},{"given":"Ian","family":"Herszterg","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8502-8111","authenticated-orcid":false,"given":"Tyler","family":"Perini","sequence":"additional","affiliation":[]},{"given":"Natashia","family":"Boland","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Savelsbergh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,1,12]]},"reference":[{"key":"843_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/mnsc.25.1.73","volume":"25","author":"YP Aneja","year":"1979","unstructured":"Aneja YP, Nair KP (1979) Bicriteria transportation problem. Manag Sci 25:73\u201378","journal-title":"Manag Sci"},{"key":"843_CR2","unstructured":"Belotti P, Soylu B, Wiecek MM (2013) A branch-and-bound algorithm for biobjective mixed-integer programs. Optim Online"},{"key":"843_CR3","doi-asserted-by":"crossref","unstructured":"Boland N, Charkhgard H, Savelsbergh M (2015a) A criterion space search algorithm for biobjective integer programming: the balanced box method. INFORMS J Comput 27:735\u2013754","DOI":"10.1287\/ijoc.2015.0657"},{"key":"843_CR4","doi-asserted-by":"crossref","unstructured":"Boland N, Charkhgard H, Savelsbergh M (2015b) A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method. INFORMS J Comput 27:597\u2013618","DOI":"10.1287\/ijoc.2015.0646"},{"key":"843_CR5","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s12532-015-0093-3","volume":"8","author":"N Boland","year":"2016","unstructured":"Boland N, Charkhgard H, Savelsbergh M (2016) The l-shape search method for triobjective integer programming. Math Program Comput 8:217\u2013251","journal-title":"Math Program Comput"},{"key":"843_CR6","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.ejor.2016.03.035","volume":"260","author":"N Boland","year":"2017","unstructured":"Boland N, Charkhgard H, Savelsbergh M (2017) The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs. Eur J Oper Res 260:873\u2013885","journal-title":"Eur J Oper Res"},{"key":"843_CR7","doi-asserted-by":"crossref","unstructured":"Cabrera-Guerrero G, Ehrgott M, Mason AJ, Raith A (2021) Bi-objective optimisation over a set of convex sub-problems. Ann Oper Res, 1\u201326","DOI":"10.1007\/s10479-020-03910-3"},{"key":"843_CR8","doi-asserted-by":"crossref","unstructured":"Ceyhan G, K\u00f6ksalan M, Lokman B (2023) Finding the nondominated set and efficient integer vectors for a class of three-objective mixed-integer linear programs. Manag Sci","DOI":"10.1287\/mnsc.2023.4712"},{"key":"843_CR9","volume-title":"Multiobjective decision making: theory and methodology","author":"V Chankong","year":"2008","unstructured":"Chankong V, Haimes YY (2008) Multiobjective decision making: theory and methodology. Courier Dover Publications, Mineola"},{"key":"843_CR10","volume-title":"Multiobjective programming and planning","author":"JL Cohon","year":"1978","unstructured":"Cohon JL (1978) Multiobjective programming and planning. Academic Press, Cambridge"},{"key":"843_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.orl.2017.11.011","volume":"46","author":"R Dai","year":"2018","unstructured":"Dai R, Charkhgard H (2018) A two-stage approach for bi-objective integer linear programming. Oper Res Lett 46:81\u201387","journal-title":"Oper Res Lett"},{"key":"843_CR12","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s10898-014-0205-z","volume":"61","author":"K D\u00e4chert","year":"2015","unstructured":"D\u00e4chert K, Klamroth K (2015) A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems. J Glob Optim 61:643\u2013676","journal-title":"J Glob Optim"},{"key":"843_CR13","doi-asserted-by":"publisher","first-page":"4321","DOI":"10.1080\/02331934.2021.1939699","volume":"71","author":"E Diessel","year":"2022","unstructured":"Diessel E (2022) An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems. Optimization 71:4321\u20134366","journal-title":"Optimization"},{"key":"843_CR14","volume-title":"Multicriteria optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott M (2005) Multicriteria optimization, 2nd edn. Springer, Berlin","edition":"2"},{"key":"843_CR15","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott M, Gandibleux X (2000) A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spectr 22:425\u2013460","journal-title":"OR Spectr"},{"key":"843_CR16","doi-asserted-by":"crossref","unstructured":"Eichfelder G, Gerlach T, Warnow L (2023a) A test instance generator for multiobjective mixed-integer optimization","DOI":"10.1007\/s00186-023-00826-z"},{"key":"843_CR17","doi-asserted-by":"crossref","unstructured":"Eichfelder G, Stein O, Warnow L (2023b) A solver for multiobjective mixed-integer convex and nonconvex optimization. J Optim Theory Appl 1\u201331","DOI":"10.1007\/s10957-023-02285-2"},{"key":"843_CR18","unstructured":"Emre D (2020) Exact solution algorithms for biobjective mixed integer programming problems. Ph.D. Thesis, Bilkent University"},{"key":"843_CR19","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/j.ejor.2017.09.026","volume":"266","author":"A Fattahi","year":"2018","unstructured":"Fattahi A, Turkay M (2018) A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems. Eur J Oper Res 266:415\u2013425","journal-title":"Eur J Oper Res"},{"key":"843_CR20","volume-title":"Multiple criteria optimization: state of the art annotated bibliographic surveys","author":"X Gandibleux","year":"2006","unstructured":"Gandibleux X (2006) Multiple criteria optimization: state of the art annotated bibliographic surveys, vol 52. Springer, Berlin"},{"key":"843_CR21","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1016\/0022-247X(68)90201-1","volume":"22","author":"AM Geoffrion","year":"1968","unstructured":"Geoffrion AM (1968) Proper efficiency and the theory of vector maximization. J Math Anal Appl 22:618\u2013630","journal-title":"J Math Anal Appl"},{"key":"843_CR22","first-page":"296","volume":"1","author":"Y Haimes","year":"1971","unstructured":"Haimes Y (1971) On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Trans Syst Man Cybern 1:296\u2013297","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"843_CR23","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1002\/mcda.1780","volume":"29","author":"P Halffmann","year":"2022","unstructured":"Halffmann P, Sch\u00e4fer LE, D\u00e4chert K, Klamroth K, Ruzika S (2022) Exact algorithms for multiobjective linear optimization problems with integer variables: a state of the art survey. J Multi-Criteria Decis Anal 29:341\u2013363","journal-title":"J Multi-Criteria Decis Anal"},{"key":"843_CR24","unstructured":"Herszterg I (2020) Efficient algorithms for solving multi-objective optimization and large-scale transportation problems. Ph.D. Thesis, Georgia Institute of Technology"},{"key":"843_CR25","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.ejor.2013.08.001","volume":"232","author":"G Kirlik","year":"2014","unstructured":"Kirlik G, Say\u0131n S (2014) A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems. Eur J Oper Res 232:479\u2013488","journal-title":"Eur J Oper Res"},{"key":"843_CR26","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1016\/j.ejor.2015.03.031","volume":"245","author":"K Klamroth","year":"2015","unstructured":"Klamroth K, Lacour R, Vanderpooten D (2015) On the representation of the search region in multi-objective optimization. Eur J Oper Res 245:767\u2013778","journal-title":"Eur J Oper Res"},{"key":"843_CR27","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/S0377-2217(97)00077-5","volume":"107","author":"G Mavrotas","year":"1998","unstructured":"Mavrotas G, Diakoulaki D (1998) A branch and bound algorithm for mixed zero-one multiple objective linear programming. Eur J Oper Res 107:530\u2013541","journal-title":"Eur J Oper Res"},{"key":"843_CR28","unstructured":"Pareto V (1996) Cours d\u2019Economie Politique Profess\u00e9 a l\u2019Universit\u00e9 de Lausanne"},{"key":"843_CR29","unstructured":"Pecin D, Herszterg I, Perini T, Boland N, Savelsbergh M (2022) BOMIP GitHub project. https:\/\/github.com\/dppecin\/BOMIP"},{"key":"843_CR30","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1287\/ijoc.2019.0887","volume":"32","author":"T Perini","year":"2019","unstructured":"Perini T, Boland N, Pecin D, Savelsbergh M (2019) A criterion space method for biobjective mixed integer programming: the boxed line method. INFORMS J Comput 32:16\u201339","journal-title":"INFORMS J Comput"},{"key":"843_CR31","doi-asserted-by":"crossref","unstructured":"Pettersson W, Ozlen M (2019) Multi-objective mixed integer programming: an objective space algorithm. In: AIP conference proceedings, vol 2070. AIP Publishing","DOI":"10.1063\/1.5090006"},{"key":"843_CR32","doi-asserted-by":"crossref","unstructured":"Przybylski A, Gandibleux X, Ehrgott M (2010a) A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme. INFORMS J Comput 22:371\u2013386","DOI":"10.1287\/ijoc.1090.0342"},{"key":"843_CR33","doi-asserted-by":"crossref","unstructured":"Przybylski A, Gandibleux X, Ehrgott M (2010b) A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives. Discret Optim 7:149\u2013165","DOI":"10.1016\/j.disopt.2010.03.005"},{"key":"843_CR34","first-page":"253","volume":"73","author":"TK Ralphs","year":"2004","unstructured":"Ralphs TK, Saltzman MJ, Wiecek MM (2004) An improved algorithm for biobjective integer programming and its application to network routing problems. Ann Oper Res 73:253\u2013280","journal-title":"Ann Oper Res"},{"key":"843_CR36","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s11081-018-9399-0","volume":"20","author":"SAB Rasmi","year":"2019","unstructured":"Rasmi SAB, T\u00fcrkay M (2019) Gondef: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs. Optim Eng 20:89\u2013117","journal-title":"Optim Eng"},{"key":"843_CR35","unstructured":"Rasmi SAB, Fattahi A, T\u00fcrkay M (2017) An exact algorithm to find non-dominated facets of tri-objective milps. In: The 12th international conference on multiple objective programming and goal programming (MOPGP), pp 30\u201331"},{"key":"843_CR37","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.ejor.2018.01.026","volume":"268","author":"B Soylu","year":"2018","unstructured":"Soylu B (2018) The search-and-remove algorithm for biobjective mixed-integer linear programming problems. Eur J Oper Res 268:281\u2013299","journal-title":"Eur J Oper Res"},{"key":"843_CR38","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.cor.2016.03.001","volume":"72","author":"B Soylu","year":"2016","unstructured":"Soylu B, Y\u0131ld\u0131z GB (2016) An exact algorithm for biobjective mixed integer linear programming problems. Comput Oper Res 72:204\u2013213","journal-title":"Comput Oper Res"},{"key":"843_CR39","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1287\/mnsc.2013.1802","volume":"60","author":"T Stidsen","year":"2014","unstructured":"Stidsen T, Andersen KA, Dammann B (2014) A branch and bound algorithm for a class of biobjective mixed integer programs. Manag Sci 60:1009\u20131032","journal-title":"Manag Sci"},{"key":"843_CR40","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/S0377-2217(03)00255-8","volume":"158","author":"J Sylva","year":"2004","unstructured":"Sylva J, Crema A (2004) A method for finding the set of non-dominated vectors for multiple objective integer linear programs. Eur J Oper Res 158:46\u201355","journal-title":"Eur J Oper Res"},{"key":"843_CR41","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1287\/ijoc.2020.0953","volume":"33","author":"S Tamby","year":"2020","unstructured":"Tamby S, Vanderpooten D (2020) Enumeration of the nondominated set of multiobjective discrete optimization problems. INFORMS J Comput 33:72\u201385","journal-title":"INFORMS J Comput"},{"key":"843_CR42","unstructured":"Wolsey LA, Nemhauser GL (2014) Section I.1.4. Modeling with binary variables III: nonlinear functions and disjunctive constraints. In: Integer and combinatorial optimization. Wiley, New York"},{"key":"843_CR43","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/0022-247X(75)90189-4","volume":"49","author":"P-L Yu","year":"1975","unstructured":"Yu P-L, Zeleny M (1975) The set of all nondominated solutions in linear cases and a multicriteria simplex method. J Math Anal Appl 49:430\u2013468","journal-title":"J Math Anal Appl"},{"key":"843_CR44","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1109\/TAC.1963.1105511","volume":"8","author":"L Zadeh","year":"1963","unstructured":"Zadeh L (1963) Optimality and non-scalar-valued performance criteria. IEEE Trans Autom Control 8:59\u201360","journal-title":"IEEE Trans Autom Control"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-023-00843-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00186-023-00843-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-023-00843-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,2]],"date-time":"2024-09-02T09:04:16Z","timestamp":1725267856000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00186-023-00843-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,12]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["843"],"URL":"https:\/\/doi.org\/10.1007\/s00186-023-00843-y","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,12]]},"assertion":[{"value":"30 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This material is based upon work supported by the National Science Foundation Graduate Research Fellowship under Grant No. DGE-1650044. The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}