{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T00:25:51Z","timestamp":1781915151323,"version":"3.54.5"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T00:00:00Z","timestamp":1689724800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T00:00:00Z","timestamp":1689724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007826","name":"Technische Universit\u00e4t Ilmenau","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007826","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2024,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Application problems can often not be solved adequately by numerical algorithms as several difficulties might arise at the same time. When developing and improving algorithms which hopefully allow to handle those difficulties in the future, good test instances are required. These can then be used to detect the strengths and weaknesses of different algorithmic approaches. In this paper we present a generator for test instances to evaluate solvers for multiobjective mixed-integer linear and nonlinear optimization problems. Based on test instances for purely continuous and purely integer problems with known efficient solutions and known nondominated points, suitable multiobjective mixed-integer test instances can be generated. The special structure allows to construct instances scalable in the number of variables and objective functions. Moreover, it allows to control the resulting efficient and nondominated sets as well as the number of efficient integer assignments.<\/jats:p>","DOI":"10.1007\/s00186-023-00826-z","type":"journal-article","created":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T05:01:52Z","timestamp":1689742912000},"page":"385-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A test instance generator for multiobjective mixed-integer optimization"],"prefix":"10.1007","volume":"100","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1938-6316","authenticated-orcid":false,"given":"Gabriele","family":"Eichfelder","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5074-5284","authenticated-orcid":false,"given":"Tobias","family":"Gerlach","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2177-8466","authenticated-orcid":false,"given":"Leo","family":"Warnow","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,7,19]]},"reference":[{"key":"826_CR1","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1287\/ijoc.2015.0646","volume":"27","author":"N Boland","year":"2015","unstructured":"Boland N, Charkhgard H, Savelsbergh M (2015) A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method. INFORMS J Comput 27:597\u2013618","journal-title":"INFORMS J Comput"},{"key":"826_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1162\/evco_a_00298","volume":"30","author":"D Brockhoff","year":"2022","unstructured":"Brockhoff D, Auger A, Hansen N, Tu\u0161ar T (2022) Using well-understood single-objective functions in multiobjective black-box optimization test suites. Evol Comput 30:165\u2013193","journal-title":"Evol Comput"},{"key":"826_CR3","doi-asserted-by":"publisher","first-page":"1507","DOI":"10.1007\/s10479-020-03910-3","volume":"319","author":"G Cabrera-Guerrero","year":"2022","unstructured":"Cabrera-Guerrero G, Ehrgott M, Mason AJ, Raith A (2022) Bi-objective optimisation over a set of convex sub-problems. Ann Oper Res 319:1507\u20131532","journal-title":"Ann Oper Res"},{"key":"826_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s40747-017-0039-7","volume":"3","author":"R Cheng","year":"2017","unstructured":"Cheng R, Li M, Tian Y, Zhang X, Yang S, Jin Y, Yao X (2017) A benchmark test suite for evolutionary many-objective optimization. Complex Intell. Syst. 3:67\u201381","journal-title":"Complex Intell. Syst."},{"key":"826_CR5","doi-asserted-by":"publisher","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:3122\u20133145","journal-title":"SIAM J Optim"},{"key":"826_CR6","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.orl.2022.04.007","volume":"50","author":"M De Santis","year":"2022","unstructured":"De Santis M, Eichfelder G, Patria D (2022) On the exactness of the $$\\varepsilon $$-constraint method for biobjective nonlinear integer programming. Oper Res Lett 50:356\u2013361","journal-title":"Oper Res Lett"},{"key":"826_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ejor.2019.10.034","volume":"283","author":"M De Santis","year":"2020","unstructured":"De Santis M, Grani G, Palagi L (2020) Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming. Eur J Oper Res 283:57\u201369","journal-title":"Eur J Oper Res"},{"key":"826_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/1-84628-137-7_6","volume-title":"Evolutionary Multiobjective Optimization: Theoretical Advances and Applications","author":"K Deb","year":"2005","unstructured":"Deb K, Thiele L, Laumanns M, Zitzler E (2005) Scalable Test Problems for Evolutionary Multiobjective Optimization. In: Abraham A, Jain L, Goldberg R (eds) Evolutionary Multiobjective Optimization: Theoretical Advances and Applications. Springer, London, pp 105\u2013145"},{"key":"826_CR9","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":"826_CR10","doi-asserted-by":"crossref","unstructured":"Eichfelder G, Gerlach T, Warnow L (2023) Test Instances for Multiobjective Mixed-Integer Nonlinear Optimization. https:\/\/optimization-online.org\/?p=22458","DOI":"10.1007\/s00186-023-00826-z"},{"key":"826_CR11","doi-asserted-by":"crossref","unstructured":"Eichfelder G, Stein O, Warnow L (2022) A deterministic solver for multiobjective mixed-integer convex and nonconvex optimization. http:\/\/www.optimization-online.org\/DB_HTML\/2022\/02\/8796.html","DOI":"10.1007\/s10957-023-02285-2"},{"key":"826_CR12","doi-asserted-by":"crossref","unstructured":"Eichfelder G, Warnow L (2021) A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems. http:\/\/www.optimization-online.org\/DB_HTML\/2021\/08\/8541.html (accepted for publication in Mathematical Methods of Operations Research, 2023)","DOI":"10.1007\/s00186-023-00828-x"},{"key":"826_CR13","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. http:\/\/www.optimization-online.org\/DB_HTML\/2021\/08\/8538.html"},{"key":"826_CR14","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ejor.2023.02.032","volume":"310","author":"G Eichfelder","year":"2023","unstructured":"Eichfelder G, Warnow L (2023) Advancements in the computation of enclosures for multi-objective optimization problems. Eur J Oper Res 310:315\u2013327","journal-title":"Eur J Oper Res"},{"key":"826_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.1995.3.1.1","volume":"3","author":"CM Fonseca","year":"1995","unstructured":"Fonseca CM, Fleming PJ (1995) An overview of evolutionary algorithms in multiobjective optimization. Evol Comput 3:1\u201316","journal-title":"Evol Comput"},{"key":"826_CR16","first-page":"52","volume":"10","author":"CM Fonseca","year":"2020","unstructured":"Fonseca CM, Klamroth K, Rudolph G, Wiecek MM (2020) Scalability in Multiobjective Optimization (Dagstuhl Seminar 20031). Dagstuhl Rep 10:52\u2013129","journal-title":"Dagstuhl Rep"},{"key":"826_CR17","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-Crit Decis Anal 29:341\u2013363","journal-title":"J Multi-Crit Decis Anal"},{"key":"826_CR18","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TEVC.2005.861417","volume":"10","author":"S Huband","year":"2006","unstructured":"Huband S, Hingston P, Barone L, While L (2006) A review of multi-objective test problems and a scalable test problem toolkit. IEEE Trans Evol Comput 10:477\u2013506","journal-title":"IEEE Trans Evol Comput"},{"key":"826_CR19","unstructured":"Jayasekara Merenchige PLW, Wiecek M (2022) A Branch and Bound Algorithm for Biobjective Mixed Integer Quadratic Programs. https:\/\/optimization-online.org\/?p=21294"},{"key":"826_CR20","unstructured":"Link M, Volkwein S (2022) Computing an enclosure for multiobjective mixed-integer nonconvex optimization problems using piecewise linear relaxations. http:\/\/www.optimization-online.org\/DB_HTML\/2022\/07\/8984.html"},{"key":"826_CR21","doi-asserted-by":"crossref","unstructured":"Mela K, Koski J, Silvennoinen R (2007) Algorithm for Generating the Pareto Optimal Set of Multiobjective Nonlinear Mixed-Integer Optimization Problems, in 48th AIAA\/ASME\/ASCE\/AHS\/ASC Structures, Structural Dynamics, and Materials Conference, American Institute of Aeronautics and Astronautics","DOI":"10.2514\/6.2007-1869"},{"key":"826_CR22","doi-asserted-by":"publisher","first-page":"1866","DOI":"10.1021\/ie970720n","volume":"37","author":"KP Papalexandri","year":"1998","unstructured":"Papalexandri KP, Dimkou TI (1998) A parametric mixed-integer optimization algorithm for multiobjective engineering problems involving discrete decisions. Ind Eng Chem Res 37:1866\u20131882","journal-title":"Ind Eng Chem Res"},{"key":"826_CR23","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":"826_CR24","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":"826_CR25","unstructured":"Schaffer JD (1985) Some experiments in machine learning using vector evaluated genetic algorithms, PhD thesis, Vanderbilt Univiversity, Nashville, TN (USA)"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-023-00826-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00186-023-00826-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-023-00826-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,2]],"date-time":"2024-09-02T09:03:58Z","timestamp":1725267838000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00186-023-00826-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,19]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["826"],"URL":"https:\/\/doi.org\/10.1007\/s00186-023-00826-z","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,19]]},"assertion":[{"value":"22 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All 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"}}]}}