{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:22:40Z","timestamp":1753273360384},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"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-024-00871-2","type":"journal-article","created":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T03:46:19Z","timestamp":1722570379000},"page":"175-220","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem"],"prefix":"10.1007","volume":"100","author":[{"given":"Samira","family":"Fallah","sequence":"first","affiliation":[]},{"given":"Ted K.","family":"Ralphs","sequence":"additional","affiliation":[]},{"given":"Natashia L.","family":"Boland","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,2]]},"reference":[{"issue":"2","key":"871_CR1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10107-003-0475-6","volume":"100","author":"S Ahmed","year":"2004","unstructured":"Ahmed S, Tawarmalani M, Sahinidis NV (2004) A finite branch-and-bound algorithm for two-stage stochastic integer programs. Math Program 100(2):355\u2013377","journal-title":"Math Program"},{"key":"871_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-6328-5","volume-title":"Non-linear parametric optimization","author":"B Bank","year":"1982","unstructured":"Bank B, Guddat J, Klatte D, Kummer B, Tammer K (1982) Non-linear parametric optimization. Springer, Berlin"},{"key":"871_CR3","unstructured":"Belotti P (2009) Couenne: a user\u2019s manual"},{"key":"871_CR4","unstructured":"Belotti P, Soylu B, Wiecek MM (2013) A branch-and-bound algorithm for biobjective mixed-integer programs. Optimization Online"},{"issue":"4","key":"871_CR5","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/BF00933152","volume":"26","author":"HP Benson","year":"1978","unstructured":"Benson HP (1978) Existence of efficient solutions for vector maximization problems. J Optim Theory Appl 26(4):569\u2013580","journal-title":"J Optim Theory Appl"},{"issue":"1","key":"871_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1008215702611","volume":"13","author":"HP Benson","year":"1998","unstructured":"Benson HP (1998) An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem. J Glob Optim 13(1):1\u201324","journal-title":"J Glob Optim"},{"issue":"2","key":"871_CR7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01585994","volume":"71","author":"C Blair","year":"1995","unstructured":"Blair C (1995) A closed-form representation of mixed-integer program value functions. Math Program 71(2):127\u2013136","journal-title":"Math Program"},{"issue":"2","key":"871_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0012-365X(77)90028-0","volume":"19","author":"CE Blair","year":"1977","unstructured":"Blair CE, Jeroslow RG (1977) The value function of a mixed integer program: I. Discrete Math 19(2):121\u2013138","journal-title":"Discrete Math"},{"issue":"1","key":"871_CR9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0012-365X(79)90147-X","volume":"25","author":"CE Blair","year":"1979","unstructured":"Blair CE, Jeroslow RG (1979) The value function of a mixed integer program: Ii. Discrete Math 25(1):7\u201319","journal-title":"Discrete Math"},{"issue":"1","key":"871_CR10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF01583794","volume":"23","author":"CE Blair","year":"1982","unstructured":"Blair CE, Jeroslow RG (1982) The value function of an integer program. Math Program 23(1):237\u2013273","journal-title":"Math Program"},{"issue":"3","key":"871_CR11","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0166-218X(84)90022-2","volume":"9","author":"CE Blair","year":"1984","unstructured":"Blair CE, Jeroslow RG (1984) Constructive characterizations of the value-function of a mixed-integer program i. Discrete Appl Math 9(3):217\u2013233","journal-title":"Discrete Appl Math"},{"issue":"1","key":"871_CR12","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10107-021-01765-5","volume":"196","author":"M Bodur","year":"2022","unstructured":"Bodur M, Ahmed S, Boland N, Nemhauser GL (2022) Decomposition of loosely coupled integer programs: a multiobjective perspective. Math Program 196(1):427\u2013477","journal-title":"Math Program"},{"key":"871_CR13","volume-title":"On the relationship of the tchebycheff norm and the efficient frontier of multiple-criteria objectives, Multiple criteria decision making, 76\u201386","author":"VJ Bowman","year":"1976","unstructured":"Bowman VJ (1976) On the relationship of the tchebycheff norm and the efficient frontier of multiple-criteria objectives, Multiple criteria decision making, 76\u201386. Springer, Berlin"},{"key":"871_CR14","doi-asserted-by":"crossref","unstructured":"Brown S, Zhang W, Ajayi T, Schaefer AJ (2021) A gilmore-gomory construction of integer programming value functions. Oper Res Lett","DOI":"10.1016\/j.orl.2021.04.008"},{"issue":"2","key":"871_CR15","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/0377-2217(86)90093-7","volume":"25","author":"L Chalmet","year":"1986","unstructured":"Chalmet L, Lemonidis L, Elzinga D (1986) An algorithm for the bi-criterion integer programming problem. Eur J Oper Res 25(2):292\u2013300","journal-title":"Eur J Oper Res"},{"key":"871_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer programming","author":"M Conforti","year":"2014","unstructured":"Conforti M, Cornu\u00e9jols G, Zambelli G (2014) Integer programming, vol 271. Springer, Berlin"},{"key":"871_CR17","doi-asserted-by":"crossref","unstructured":"Conti P, Traverso C (1991) Buchberger algorithm and integer programming. In: International symposium on applied algebra, algebraic algorithms, and error-correcting codes, pp 130\u2013139. Springer","DOI":"10.1007\/3-540-54522-0_102"},{"issue":"1","key":"871_CR18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10589-015-9760-6","volume":"63","author":"L Csirmaz","year":"2016","unstructured":"Csirmaz L (2016) Using multiobjective optimization to map the entropy region. Comput Optim Appl 63(1):45\u201367","journal-title":"Comput Optim Appl"},{"issue":"4","key":"871_CR19","doi-asserted-by":"crossref","first-page":"3122","DOI":"10.1137\/19M1264709","volume":"30","author":"M De Santis","year":"2020","unstructured":"De Santis M, Eichfelder G, Niebling J, Rockt\u00e4schel S (2020) Solving multiobjective mixed integer convex optimization problems. SIAM J Optim 30(4):3122\u20133145","journal-title":"SIAM J Optim"},{"key":"871_CR20","doi-asserted-by":"crossref","unstructured":"Dunbar A, Sinha S, Schaefer AJ (2023) Relaxations and duality for multiobjective integer programming. Math Program 1\u201340","DOI":"10.1007\/s10107-023-02022-7"},{"key":"871_CR21","volume-title":"Multicriteria optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott M (2005) Multicriteria optimization, vol 491. Springer, Berlin"},{"issue":"1","key":"871_CR22","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10479-006-0074-z","volume":"147","author":"M Ehrgott","year":"2006","unstructured":"Ehrgott M (2006) A discussion of scalarization techniques for multiple objective integer programming. Ann Oper Res 147(1):343\u2013360","journal-title":"Ann Oper Res"},{"issue":"4","key":"871_CR23","doi-asserted-by":"crossref","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-Spektrum 22(4):425\u2013460","journal-title":"OR-Spektrum"},{"key":"871_CR24","volume-title":"Exact methods for multi-objective combinatorial optimisation, multiple criteria decision analysis, 817\u2013850","author":"M Ehrgott","year":"2016","unstructured":"Ehrgott M, Gandibleux X, Przybylski A (2016) Exact methods for multi-objective combinatorial optimisation, multiple criteria decision analysis, 817\u2013850. Springer, Berlin"},{"key":"871_CR25","first-page":"667","volume-title":"Mutiobjective programming","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott M, Wiecek MM (2005) Mutiobjective programming. Springer New York, New York, pp 667\u2013708"},{"key":"871_CR26","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10898-020-00984-y","volume":"80","author":"G Eichfelder","year":"2021","unstructured":"Eichfelder G, Kirst P, Meng L, Stein O (2021) A general branch-and-bound framework for continuous global multiobjective optimization. J Glob Optim 80:195\u2013227","journal-title":"J Glob Optim"},{"key":"871_CR27","unstructured":"Eichfelder G, Warnow L (2021) On implementation details and numerical experiments for the hypad algorithm to solve multi-objective mixed-integer convex optimization problems. Preprint: 08-8538"},{"key":"871_CR28","doi-asserted-by":"crossref","unstructured":"Eichfelder G, Warnow L (2023) A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems. Math Methods Oper Res 1\u201330","DOI":"10.1007\/s00186-023-00828-x"},{"issue":"124","key":"871_CR29","first-page":"1","volume":"1902","author":"J Farkas","year":"1902","unstructured":"Farkas J (1902) Theorie der einfachen ungleichungen. Journal f\u00fcr die reine und angewandte Mathematik (Crelles Journal) 1902(124):1\u201327","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik (Crelles Journal)"},{"key":"871_CR30","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.106012","volume":"148","author":"N Forget","year":"2022","unstructured":"Forget N, Gadegaard SL, Klamroth K, Nielsen LR, Przybylski A (2022) Branch-and-bound and objective branching with three or more objectives. Comput Oper Res 148:106012","journal-title":"Comput Oper Res"},{"key":"871_CR31","doi-asserted-by":"crossref","unstructured":"Forget N, Gadegaard SL, Nielsen LR (2022) Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs. Eur J Oper Res","DOI":"10.1016\/j.ejor.2022.01.047"},{"key":"871_CR32","unstructured":"Guddat J, Vasquez F Guerra, Tammer K, Wendler K (1985) Multiobjective and stochastic optimization based on parametric optimization. Math Res 26"},{"key":"871_CR33","unstructured":"Guzelsoy M, Ralphs T (2006) The value function of a mixed-integer linear program with a single constraint. To be submitted"},{"key":"871_CR34","first-page":"118","volume":"4","author":"M G\u00fczelsoy","year":"2007","unstructured":"G\u00fczelsoy M, Ralphs T (2007) Duality for mixed-integer linear programs. Int J Oper Res 4:118\u2013137","journal-title":"Int J Oper Res"},{"issue":"3","key":"871_CR35","first-page":"118","volume":"4","author":"M Guzelsoy","year":"2007","unstructured":"Guzelsoy M, Ralphs TK (2007) Duality for mixed-integer linear programs. Int J Oper Res 4(3):118\u2013137","journal-title":"Int J Oper Res"},{"issue":"3","key":"871_CR36","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(3):296\u2013297","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"871_CR37","doi-asserted-by":"crossref","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","DOI":"10.1002\/mcda.1780"},{"issue":"4","key":"871_CR38","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1007\/s10898-013-0098-2","volume":"59","author":"AH Hamel","year":"2014","unstructured":"Hamel AH, L\u00f6hne A, Rudloff B (2014) Benson type algorithms for linear vector optimization and applications. J Glob Optim 59(4):811\u2013836","journal-title":"J Glob Optim"},{"issue":"2","key":"871_CR39","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10107-006-0711-y","volume":"108","author":"N Kong","year":"2006","unstructured":"Kong N, Schaefer AJ, Hunsaker B (2006) Two-stage integer programs with stochastic right-hand sides: a superadditive dual approach. Math Program 108(2):275\u2013296","journal-title":"Math Program"},{"key":"871_CR40","unstructured":"Link M, Volkwein S (2022) Computing an enclosure for multiobjective mixed-integer nonconvex optimization problems using piecewise linear relaxations"},{"key":"871_CR41","unstructured":"L\u00f6hne A, Wei\u00dfing B (2015) Bensolve-vlp solver, version 2.0. 1. http:\/\/bensolve.org"},{"key":"871_CR42","doi-asserted-by":"crossref","unstructured":"Nemhauser G, Wolsey L (1988) The scope of integer and combinatorial optimization. Integer Comb Optim 1\u201326","DOI":"10.1002\/9781118627372.ch1"},{"issue":"4","key":"871_CR43","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/BF00934564","volume":"42","author":"A Pascoletti","year":"1984","unstructured":"Pascoletti A, Serafini P (1984) Scalarizing vector optimization problems. J Optim Theory Appl 42(4):499\u2013524","journal-title":"J Optim Theory Appl"},{"issue":"3","key":"871_CR44","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 (2017) Multi-objective branch and bound. Eur J Oper Res 260(3):856\u2013872","journal-title":"Eur J Oper Res"},{"key":"871_CR45","unstructured":"Ralphs TK, Hassanzadeh A (2014) On the value function of a mixed integer linear optimization problem and an algorithm for its construction. COR@ L Technical Report 14T-004"},{"issue":"1","key":"871_CR46","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10479-006-0058-z","volume":"147","author":"TK Ralphs","year":"2006","unstructured":"Ralphs TK, Saltzman MJ, Wiecek MM (2006) An improved algorithm for solving biobjective integer programs. Ann Oper Res 147(1):43\u201370","journal-title":"Ann Oper Res"},{"issue":"1","key":"871_CR47","doi-asserted-by":"crossref","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(1):89\u2013117","journal-title":"Optim Eng"},{"key":"871_CR48","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1997","unstructured":"Rockafellar RT (1997) Convex analysis, vol 11. Princeton University Press, Princeton"},{"key":"871_CR49","volume-title":"Variational analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar RT, Wets RJB (2009) Variational analysis, vol 317. Springer, Berlin"},{"issue":"3","key":"871_CR50","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10957-005-5494-4","volume":"126","author":"S Ruzika","year":"2005","unstructured":"Ruzika S, Wiecek MM (2005) Approximation methods in multiobjective programming. J Optim Theory Appl 126(3):473\u2013501","journal-title":"J Optim Theory Appl"},{"issue":"1","key":"871_CR51","first-page":"229","volume":"83","author":"R Schultz","year":"1998","unstructured":"Schultz R, Stougie L, Van Der Vlerk MH (1998) Solving stochastic programs with integer recourse by enumeration: a framework using gr\u00f6bner basis. Math Program 83(1):229\u2013252","journal-title":"Math Program"},{"issue":"1","key":"871_CR52","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1287\/ijoc.2020.0953","volume":"33","author":"S Tamby","year":"2021","unstructured":"Tamby S, Vanderpooten D (2021) Enumeration of the nondominated set of multiobjective discrete optimization problems. INFORMS J Comput 33(1):72\u201385","journal-title":"INFORMS J Comput"},{"key":"871_CR53","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.disopt.2014.11.003","volume":"15","author":"AC Trapp","year":"2015","unstructured":"Trapp AC, Prokopyev OA (2015) A note on constraint aggregation and value functions for two-stage stochastic integer programs. Discrete Optim 15:37\u201345","journal-title":"Discrete Optim"},{"issue":"2","key":"871_CR54","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.1120.1156","volume":"61","author":"AC Trapp","year":"2013","unstructured":"Trapp AC, Prokopyev OA, Schaefer AJ (2013) On a level-set characterization of the value function of an integer program and its application to stochastic programming. Oper Res 61(2):498\u2013511","journal-title":"Oper Res"},{"issue":"1","key":"871_CR55","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01589344","volume":"20","author":"LA Wolsey","year":"1981","unstructured":"Wolsey LA (1981) Integer programming duality: price functions and sensitivity analysis. Math Program 20(1):173\u2013195","journal-title":"Math Program"},{"issue":"8","key":"871_CR56","first-page":"936","volume":"19","author":"PL Yu","year":"1973","unstructured":"Yu PL (1973) A class of solutions for group decision problems. Manag Sci 19(8):936\u2013946","journal-title":"Manag Sci"},{"issue":"1","key":"871_CR57","doi-asserted-by":"crossref","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(1):59\u201360","journal-title":"IEEE Trans Autom Control"},{"key":"871_CR58","unstructured":"Zeleny M (1973) Compromise programming. Multiple criteria decision making"},{"key":"871_CR59","doi-asserted-by":"crossref","unstructured":"Zhang J, \u00d6zalt\u0131n OY (2021) Bilevel integer programs with stochastic right-hand sides. INFORMS J Comput","DOI":"10.1287\/ijoc.2020.1055"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-024-00871-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00186-024-00871-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-024-00871-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,2]],"date-time":"2024-09-02T09:06:14Z","timestamp":1725267974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00186-024-00871-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["871"],"URL":"https:\/\/doi.org\/10.1007\/s00186-024-00871-2","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2024,8]]},"assertion":[{"value":"28 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 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":"The authors declare that they do not have any identifiable conflicting financial interests or personal relationships that could have potentially influenced the findings presented in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}