{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:59:01Z","timestamp":1753275541347,"version":"3.37.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,10,12]],"date-time":"2023-10-12T00:00:00Z","timestamp":1697068800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,12]],"date-time":"2023-10-12T00:00:00Z","timestamp":1697068800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1933373"],"award-info":[{"award-number":["CMMI-1933373"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-21-1-2262"],"award-info":[{"award-number":["N00014-21-1-2262"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s10107-023-02022-7","type":"journal-article","created":{"date-parts":[[2023,10,12]],"date-time":"2023-10-12T13:02:21Z","timestamp":1697115741000},"page":"577-616","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Relaxations and duality for multiobjective integer programming"],"prefix":"10.1007","volume":"207","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-0552-7198","authenticated-orcid":false,"given":"Alex","family":"Dunbar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7979-0150","authenticated-orcid":false,"given":"Saumya","family":"Sinha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0379-741X","authenticated-orcid":false,"given":"Andrew J.","family":"Schaefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,12]]},"reference":[{"issue":"1","key":"2022_CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/mnsc.25.1.73","volume":"25","author":"YP Aneja","year":"1979","unstructured":"Aneja, Y.P., Nair, K.P.K.: Bicriteria transportation problem. Manag. Sci. 25(1), 73\u201378 (1979)","journal-title":"Manag. Sci."},{"key":"2022_CR2","doi-asserted-by":"crossref","unstructured":"Benson, H.P.: Multi-objective optimization: Pareto optimal solutions, properties. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 2478\u20132481. Springer, Boston (2009)","DOI":"10.1007\/978-0-387-74759-0_426"},{"issue":"3","key":"2022_CR3","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1016\/j.ejor.2016.02.037","volume":"260","author":"N Boland","year":"2017","unstructured":"Boland, N., Charkhgard, H., Savelsbergh, M.: A new method for optimizing a linear function over the efficient set of a multiobjective integer program. Eur. J. Oper. Res. 260(3), 904\u2013919 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2022_CR4","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/j.ejor.2015.01.035","volume":"244","author":"A Cerqueus","year":"2015","unstructured":"Cerqueus, A., Przybylski, A., Gandibleux, X.: Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems. Eur. J. Oper. Res. 244(2), 417\u2013433 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2022_CR5","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0022-247X(84)90028-3","volume":"104","author":"H Corley","year":"1984","unstructured":"Corley, H.: Duality theory for the matrix linear programming problem. J. Math. Anal. Appl. 104(1), 47\u201352 (1984)","journal-title":"J. Math. Anal. Appl."},{"issue":"3","key":"2022_CR6","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/j.ejor.2016.05.029","volume":"260","author":"K D\u00e4chert","year":"2017","unstructured":"D\u00e4chert, K., Klamroth, K., Lacour, R., Vanderpooten, D.: Efficient computation of the search region in multi-objective optimization. Eur. J. Oper. Res. 260(3), 841\u2013855 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"2022_CR7","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Berlin (2005)"},{"issue":"1","key":"2022_CR8","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10479-006-0074-z","volume":"147","author":"M Ehrgott","year":"2006","unstructured":"Ehrgott, M.: A discussion of scalarization techniques for multiple objective integer programming. Ann. Oper. Res. 147(1), 343\u2013360 (2006)","journal-title":"Ann. Oper. Res."},{"key":"2022_CR9","doi-asserted-by":"crossref","unstructured":"Ehrgott, M., Gandibleux, X.: Bounds and bound sets for biobjective combinatorial optimization problems. In: Multiple Criteria Decision Making in the New Millennium, pp. 241\u2013253. Springer (2001)","DOI":"10.1007\/978-3-642-56680-6_22"},{"issue":"9","key":"2022_CR10","doi-asserted-by":"crossref","first-page":"2674","DOI":"10.1016\/j.cor.2005.10.003","volume":"34","author":"M Ehrgott","year":"2007","unstructured":"Ehrgott, M., Gandibleux, X.: Bound sets for biobjective combinatorial optimization problems. Comput. Oper. Res. 34(9), 2674\u20132694 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"2022_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"ML Fisher","year":"1981","unstructured":"Fisher, M.L.: The Lagrangian relaxation method for solving integer programming problems. Manag. Sci. 27(1), 1\u201318 (1981)","journal-title":"Manag. Sci."},{"issue":"3","key":"2022_CR12","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1016\/j.ejor.2022.01.047","volume":"302","author":"N Forget","year":"2022","unstructured":"Forget, N., Gadegaard, S.L., Nielsen, L.R.: Warm-starting lower bound set computations for branch-and-bound algorithms for multiobjective integer linear programs. Eur. J. Oper. Res. 302(3), 909\u2013924 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"2022_CR13","first-page":"317","volume":"13","author":"D Gale","year":"1951","unstructured":"Gale, D., Kuhn, H.W., Tucker, A.W.: Linear programming and the theory of games. Activity Analysis of Production and Allocation 13, 317\u2013335 (1951)","journal-title":"Activity Analysis of Production and Allocation"},{"key":"2022_CR14","unstructured":"Gandibleux, X., Soleihac, G., Przybylski, A.: vOptSolver: an ecosystem for multi-objective linear optimization. In: JuliaCon 2021 (2021)"},{"key":"2022_CR15","unstructured":"Gandibleux, X., Soleilhac, G., Przybylski, A., Lucas, F., Ruzika, S., Halffmann, P.: vOptSolver, a \u201cget and run\u201d solver of multiobjective linear optimization problems built on Julia and JuMP. In: MCDM2017: 24th International Conference on Multiple Criteria Decision Making, vol.\u00a088 (2017)"},{"key":"2022_CR16","unstructured":"Gandibleux, X., Soleilhac, G., Przybylski, A., Ruzika, S.: vOptSolver: an open source software environment for multiobjective mathematical optimization. In: IFORS2017: 21st Conference of the International Federation of Oprational Research Societies (2017)"},{"issue":"3","key":"2022_CR17","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/0022-247X(68)90201-1","volume":"22","author":"AM Geoffrion","year":"1968","unstructured":"Geoffrion, A.M.: Proper efficiency and the theory of vector maximization. J. Math. Anal. Appl. 22(3), 618\u2013630 (1968)","journal-title":"J. Math. Anal. Appl."},{"key":"2022_CR18","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion, A.M.: Lagrangean relaxation and its uses in integer programming. Math. Program. 2, 82\u2013114 (1974)","journal-title":"Math. Program."},{"issue":"1","key":"2022_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00186-014-0467-8","volume":"80","author":"D Gourion","year":"2014","unstructured":"Gourion, D., Luc, D.: Saddle points and scalarizing sets in multiple objective linear programming. Math. Methods Oper. Res. 80(1), 1\u201327 (2014)","journal-title":"Math. Methods Oper. Res."},{"issue":"3","key":"2022_CR20","first-page":"296","volume":"SMC\u20131","author":"Y Haimes","year":"1971","unstructured":"Haimes, Y., Lasdon, L., Wismer, D.: On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Trans. Syst. Man Cybern. SMC\u20131(3), 296\u2013297 (1971)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"2022_CR21","first-page":"1","volume":"2022","author":"P Halffmann","year":"2022","unstructured":"Halffmann, P., Sch\u00e4fer, L.E., D\u00e4chert, K., Klamroth, K., Ruzika, S.: Exact algorithms for multiobjective linear optimization problems with integer variables: a state of the art survey. J. Multi-Criteria Decis. Anal. 2022, 1\u201323 (2022)","journal-title":"J. Multi-Criteria Decis. Anal."},{"issue":"1","key":"2022_CR22","first-page":"163","volume":"11","author":"AH Hamel","year":"2004","unstructured":"Hamel, A.H., Heyde, F., L\u00f6hne, A., Tammer, C., Winkler, K.: Closing the duality gap in linear vector optimization. J. Convex Anal. 11(1), 163\u2013178 (2004)","journal-title":"J. Convex Anal."},{"key":"2022_CR23","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1137\/060674831","volume":"19","author":"F Heyde","year":"2008","unstructured":"Heyde, F., L\u00f6hne, A.: Geometric duality in multiple objective linear programming. SIAM J. Optim. 19, 836\u2013845 (2008)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2022_CR24","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s00186-008-0216-y","volume":"69","author":"F Heyde","year":"2009","unstructured":"Heyde, F., L\u00f6hne, A., Tammer, C.: Set-valued duality theory for multiple objective linear programs and application to mathematical finance. Math. Methods Oper. Res. 69(1), 159\u2013179 (2009)","journal-title":"Math. Methods Oper. Res."},{"key":"2022_CR25","first-page":"1657","volume-title":"Encyclopedia of Optimization","author":"JN Hooker","year":"2009","unstructured":"Hooker, J.N.: Integer programming duality. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 1657\u20131667. Springer, Boston (2009)"},{"issue":"1","key":"2022_CR26","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1287\/opre.22.1.189","volume":"22","author":"H Isermann","year":"1974","unstructured":"Isermann, H.: Proper efficiency and the linear vector maximum problem. Oper. Res. 22(1), 189\u2013191 (1974)","journal-title":"Oper. Res."},{"issue":"1","key":"2022_CR27","first-page":"33","volume":"22","author":"H Isermann","year":"1978","unstructured":"Isermann, H.: On some relations between a dual pair of multiple objective linear programs. Z. Oper. Res. 22(1), 33\u201341 (1978)","journal-title":"Z. Oper. Res."},{"issue":"2","key":"2022_CR28","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0012-365X(78)90112-7","volume":"23","author":"R Jeroslow","year":"1978","unstructured":"Jeroslow, R.: Cutting-plane theory: algebraic methods. Discrete Math. 23(2), 121\u2013150 (1978)","journal-title":"Discrete Math."},{"issue":"4","key":"2022_CR29","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1287\/ijoc.1110.0476","volume":"24","author":"N Jozefowiez","year":"2012","unstructured":"Jozefowiez, N., Laporte, G., Semet, F.: A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem. INFORMS J. Comput. 24(4), 554\u2013564 (2012)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"2022_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/B:JOGO.0000035000.06101.07","volume":"29","author":"K Klamroth","year":"2004","unstructured":"Klamroth, K., Tind, J., Zust, S.: Integer programming duality in multiple objective programming. J. Global Optim. 29(1), 1\u201318 (2004)","journal-title":"J. Global Optim."},{"issue":"4","key":"2022_CR31","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1057\/jors.1974.108","volume":"25","author":"J Kornbluth","year":"1974","unstructured":"Kornbluth, J.: Duality, indifference and sensitivity analysis in multiple objective linear programming. J. Oper. Res. Soc. 25(4), 599\u2013614 (1974)","journal-title":"J. Oper. Res. Soc."},{"key":"2022_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-18351-5","volume-title":"Vector Optimization with Infimum and Supremum","author":"A L\u00f6hne","year":"2011","unstructured":"L\u00f6hne, A.: Vector Optimization with Infimum and Supremum. Springer, Berlin (2011)"},{"issue":"2","key":"2022_CR33","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/j.ejor.2010.09.024","volume":"210","author":"DT Luc","year":"2011","unstructured":"Luc, D.T.: On duality in multiple objective linear programming. Eur. J. Oper. Res. 210(2), 158\u2013168 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"2022_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-21091-9","volume-title":"Multiobjective Linear Programming: An Introduction","author":"DT Luc","year":"2016","unstructured":"Luc, D.T.: Multiobjective Linear Programming: An Introduction. Springer, Berlin (2016)"},{"issue":"3","key":"2022_CR35","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s10732-009-9103-9","volume":"16","author":"T Lust","year":"2010","unstructured":"Lust, T., Teghem, J.: Two-phase Pareto local search for the biobjective traveling salesman problem. J. Heuristics 16(3), 475\u2013510 (2010)","journal-title":"J. Heuristics"},{"issue":"1","key":"2022_CR36","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10898-015-0324-1","volume":"64","author":"E Machuca","year":"2016","unstructured":"Machuca, E., Mandow, L.: Lower bound sets for biobjective shortest path problems. J. Global Optim. 64(1), 63\u201377 (2016)","journal-title":"J. Global Optim."},{"key":"2022_CR37","unstructured":"Makhorin, A.: GLPK (GNU linear programming kit). https:\/\/www.gnu.org\/software\/glpk (2012)"},{"issue":"1","key":"2022_CR38","first-page":"53","volume":"171","author":"G Mavrotas","year":"2005","unstructured":"Mavrotas, G., Diakoulaki, D.: Multi-criteria branch and bound: a vector maximization algorithm for mixed 0\u20131 multiple objective linear programming. Appl. Math. Comput. 171(1), 53\u201371 (2005)","journal-title":"Appl. Math. Comput."},{"issue":"12","key":"2022_CR39","doi-asserted-by":"crossref","first-page":"2302","DOI":"10.1287\/mnsc.1100.1248","volume":"56","author":"\u00d6 \u00d6zpeynirci","year":"2010","unstructured":"\u00d6zpeynirci, \u00d6., K\u00f6ksalan, M.: An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs. Manag. Sci. 56(12), 2302\u20132315 (2010)","journal-title":"Manag. Sci."},{"issue":"3","key":"2022_CR40","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1016\/j.ejor.2017.01.032","volume":"260","author":"A Przybylski","year":"2017","unstructured":"Przybylski, A., Gandibleux, X.: Multi-objective branch and bound. Eur. J. Oper. Res. 260(3), 856\u2013872 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2022_CR41","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1287\/ijoc.1090.0342","volume":"22","author":"A Przybylski","year":"2010","unstructured":"Przybylski, A., Gandibleux, X., Ehrgott, M.: A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme. INFORMS J. Comput. 22(3), 371\u2013386 (2010)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"2022_CR42","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.disopt.2010.03.005","volume":"7","author":"A Przybylski","year":"2010","unstructured":"Przybylski, A., Gandibleux, X., Ehrgott, M.: A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives. Discrete Optim. 7(3), 149\u2013165 (2010)","journal-title":"Discrete Optim."},{"issue":"1","key":"2022_CR43","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0377-2217(77)81008-4","volume":"1","author":"W R\u00f6dder","year":"1977","unstructured":"R\u00f6dder, W.: A generalized saddlepoint theory: its application to duality theory for linear vector optimum problems. Eur. J. Oper. Res. 1(1), 55\u201359 (1977)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2022_CR44","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1287\/ijoc.1070.0260","volume":"20","author":"F Sourd","year":"2008","unstructured":"Sourd, F., Spanjaard, O.: A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem. INFORMS J. Comput. 20(3), 472\u2013484 (2008)","journal-title":"INFORMS J. Comput."},{"key":"2022_CR45","first-page":"2448","volume-title":"Encyclopedia of Optimization","author":"J Teghem","year":"2009","unstructured":"Teghem, J.: Multi-objective integer linear programming. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 2448\u20132454. Springer, Boston (2009)"},{"issue":"2","key":"2022_CR46","first-page":"149","volume":"20","author":"EL Ulungu","year":"1995","unstructured":"Ulungu, E.L., Teghem, J.: The two phases method: an efficient procedure to solve bi-objective combinatorial optimization problems. Found. Comput. Decis. Sci. 20(2), 149\u2013165 (1995)","journal-title":"Found. Comput. Decis. Sci."},{"issue":"1","key":"2022_CR47","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/j.cor.2012.08.003","volume":"40","author":"T Vincent","year":"2013","unstructured":"Vincent, T., Seipp, F., Ruzika, S., Przybylski, A., Gandibleux, X.: Multiple objective branch and bound for mixed 0\u20131 linear programming: corrections and improvements for the biobjective case. Comput. Oper. Res. 40(1), 498\u2013509 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"2022_CR48","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01589344","volume":"20","author":"LA Wolsey","year":"1981","unstructured":"Wolsey, L.A.: Integer programming duality: price functions and sensitivity analysis. Math. Program. 20(1), 173\u2013195 (1981)","journal-title":"Math. Program."},{"key":"2022_CR49","volume-title":"Integer and Combinatorial Optimization","author":"LA Wolsey","year":"2014","unstructured":"Wolsey, L.A., Nemhauser, G.L.: Integer and Combinatorial Optimization. Wiley, New York (2014)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02022-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-02022-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-02022-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T15:07:24Z","timestamp":1723043244000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-02022-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,12]]},"references-count":49,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["2022"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-02022-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2023,10,12]]},"assertion":[{"value":"2 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}