{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T06:07:45Z","timestamp":1784182065941,"version":"3.55.0"},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T00:00:00Z","timestamp":1776297600000},"content-version":"vor","delay-in-days":105,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100007826","name":"Technische Universit\u00e4t Ilmenau","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007826","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1016\/j.ejco.2026.100127","type":"journal-article","created":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:41:28Z","timestamp":1776444088000},"page":"100127","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Properties of enclosures in multiobjective optimization"],"prefix":"10.1016","volume":"14","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\/0009-0001-2725-2692","authenticated-orcid":false,"given":"Daniel","family":"Hoff","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejco.2026.100127_bib0005","series-title":"Multicriteria Optimization","author":"Ehrgott","year":"2005"},{"key":"10.1016\/j.ejco.2026.100127_bib0010","series-title":"Adaptive Scalarization Methods in Multiobjective Optimization","author":"Eichfelder","year":"2008"},{"key":"10.1016\/j.ejco.2026.100127_bib0015","series-title":"Vector Optimization: Theory, Applications, and Extensions","author":"Jahn","year":"2011"},{"key":"10.1016\/j.ejco.2026.100127_bib0020","series-title":"Theory of Multiobjective Optimization","author":"Sawaragi","year":"1985"},{"issue":"3","key":"10.1016\/j.ejco.2026.100127_bib0025","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/s10957-005-5494-4","article-title":"Approximation methods in multiobjective programming","volume":"126","author":"Ruzika","year":"2005","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.ejco.2026.100127_bib0030","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10898-010-9588-7","article-title":"An approximation algorithm for convex multi-objective programming problems","volume":"50","author":"Ehrgott","year":"2011","journal-title":"J. Global Optim."},{"key":"10.1016\/j.ejco.2026.100127_bib0035","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1007\/s10898-011-9709-y","article-title":"A dual variant of Bensons \u201couter approximation algorithm\u201d for multiple objective linear programming","volume":"52","author":"Ehrgott","year":"2012","journal-title":"J. Global Optim."},{"key":"10.1016\/j.ejco.2026.100127_bib0040","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1007\/s10898-013-0098-2","article-title":"Benson type algorithm for linear vector optimization and applications","volume":"59","author":"Hamel","year":"2014","journal-title":"J. Global Optim"},{"key":"10.1016\/j.ejco.2026.100127_bib0045","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s11750-016-0430-3","article-title":"A Benson type algorithm for nonconvex multiobjective programming problems","volume":"25","author":"Nobakhtian","year":"2017","journal-title":"TOP"},{"key":"10.1016\/j.ejco.2026.100127_bib0050","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10898-020-00984-y","article-title":"A general branch-and-bound framework for continuous global multiobjective optimization","volume":"80","author":"Eichfelder","year":"2021","journal-title":"J. Global Optim."},{"key":"10.1016\/j.ejco.2026.100127_bib0055","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10898-021-01109-9","article-title":"An approximation algorithm for multi-objective optimization problems using a box-coverage","volume":"83","author":"Eichfelder","year":"2022","journal-title":"J. Global Optim."},{"key":"10.1016\/j.ejco.2026.100127_bib0060","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10898-024-01440-x","article-title":"Using dual relaxations in multiobjective mixed-integer convex quadratic programming","volume":"92","author":"De Santis","year":"2025","journal-title":"J. Global Optim."},{"key":"10.1016\/j.ejco.2026.100127_bib0065","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2023.02.032","article-title":"Advancements in the computation of enclosures for multi-objective optimization problems","volume":"310","author":"Eichfelder","year":"2023","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.ejco.2026.100127_bib0070","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s00186-023-00828-x","article-title":"A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems","volume":"100","author":"Eichfelder","year":"2023","journal-title":"Math Meth Oper Res"},{"key":"10.1016\/j.ejco.2026.100127_bib0075","series-title":"Global Optimization, Computation, Approximation and Applications","first-page":"423","article-title":"Computing an approximation of the nondominated set of multi-objective mixed-integer nonlinear optimization problems","author":"Eichfelder","year":"2025"},{"key":"10.1016\/j.ejco.2026.100127_bib0080","doi-asserted-by":"crossref","first-page":"1736","DOI":"10.1007\/s10957-023-02285-2","article-title":"A solver for multiobjective mixed-integer convex and nonconvex optimization","volume":"203","author":"Eichfelder","year":"2024","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.ejco.2026.100127_bib0085","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10898-023-01309-5","article-title":"Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs","volume":"87","author":"Link","year":"2023","journal-title":"J. Global Optim."},{"key":"10.1016\/j.ejco.2026.100127_bib0090","series-title":"2025 Design, Automation & Test in Europe Conference (DATE)","first-page":"1","article-title":"Circuits in a box: computing high-dimensional performance spaces for analog integrated circuits","author":"Ohse","year":"2025"},{"issue":"83","key":"10.1016\/j.ejco.2026.100127_bib0095","first-page":"1","article-title":"Multi-objective branch-and-bound for the design-for-control of water distribution networks with global bounds","volume":"67","author":"Ulusoy","year":"2024","journal-title":"Struct. Multidiscip. Optim."},{"key":"10.1016\/j.ejco.2026.100127_bib0100","series-title":"Solving Multi-Objective Mixed-Integer Nonlinear Optimization Problems","author":"Warnow","year":"2023"},{"key":"10.1016\/j.ejco.2026.100127_bib0105","doi-asserted-by":"crossref","DOI":"10.1007\/s12532-025-00299-7","article-title":"An adaptive relaxation-refinement scheme for multi-objective mixed-integer nonconvex optimization","author":"Eichfelder","year":"2025","journal-title":"Math. Program. Comput."},{"issue":"9","key":"10.1016\/j.ejco.2026.100127_bib0110","doi-asserted-by":"crossref","first-page":"2674","DOI":"10.1016\/j.cor.2005.10.003","article-title":"Bound sets for biobjective combinatorial optimization problems","volume":"34","author":"Ehrgott","year":"2007","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.ejco.2026.100127_bib0115","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.106012","article-title":"Branch-and-bound and objective branching with three or more objectives","volume":"148","author":"Forget","year":"2022","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.ejco.2026.100127_bib0120","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/s11750-009-0105-4","article-title":"The multicriteria big cube small cube method","volume":"18","author":"Scholz","year":"2010","journal-title":"TOP"},{"issue":"4","key":"10.1016\/j.ejco.2026.100127_bib0125","doi-asserted-by":"crossref","first-page":"3122","DOI":"10.1137\/19M1264709","article-title":"Solving multiobjective mixed integer convex optimization problems","volume":"30","author":"De Santis","year":"2020","journal-title":"SIAM J. Optim."},{"issue":"1","key":"10.1016\/j.ejco.2026.100127_bib0130","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/02331934.2022.2092479","article-title":"Limit sets in global multiobjective optimization","volume":"73","author":"Eichfelder","year":"2024","journal-title":"Optimization"},{"issue":"1","key":"10.1016\/j.ejco.2026.100127_bib0135","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1137\/18M1169680","article-title":"A branch\u2013and\u2013bound-based algorithm for nonconvex multiobjective optimization","volume":"29","author":"Niebling","year":"2019","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.ejco.2026.100127_bib0140","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s00186-024-00870-3","article-title":"An approximation algorithm for multiobjective mixed-integer convex optimization","volume":"100","author":"Lammel","year":"2024","journal-title":"Math. Methods Oper. Res."},{"issue":"2","key":"10.1016\/j.ejco.2026.100127_bib0145","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF00936165","article-title":"\u03b5-Solutions in vector minimization problems","volume":"43","author":"Loridan","year":"1984","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.ejco.2026.100127_bib0150","series-title":"Multicriteria Decision Making and Fuzzy Systems - Theory, Methods and Applications","first-page":"75","article-title":"Graef-Younes method with backward iteration","author":"Jahn","year":"2006"},{"issue":"2","key":"10.1016\/j.ejco.2026.100127_bib0155","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00940478","article-title":"Nonconvex separation theorems and some applications in vector optimization","volume":"67","author":"Gerth (Tammer)","year":"1990","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.ejco.2026.100127_bib0160","series-title":"Variational Methods in Partically Ordered Spaces","author":"G\u00f6pfert","year":"2003"},{"key":"10.1016\/j.ejco.2026.100127_bib0165","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s00186-023-00841-0","article-title":"A simple, efficient and versatile objective space algorithm for multiobjective integer programming","volume":"100","author":"D\u00e4chert","year":"2024","journal-title":"Math. Methods Oper. Res."},{"issue":"3","key":"10.1016\/j.ejco.2026.100127_bib0170","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/j.ejor.2016.05.029","article-title":"Efficient computation of the search region in multi-objective optimization","volume":"260","author":"D\u00e4chert","year":"2017","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.ejco.2026.100127_bib0175","series-title":"Convex Analysis in General Vector Spaces","author":"Z\u0103linescu","year":"2002"},{"issue":"3","key":"10.1016\/j.ejco.2026.100127_bib0180","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/j.ejor.2015.03.031","article-title":"On the representation of the search region in multi-objective optimization","volume":"245","author":"Klamroth","year":"2015","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.ejco.2026.100127_bib0185","doi-asserted-by":"crossref","first-page":"2598","DOI":"10.1137\/22M1507693","article-title":"Algorithms to solve unbounded convex vector optimization problems","volume":"33","author":"Wagner","year":"2023","journal-title":"SIAM J. Optim."}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440626000018?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440626000018?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:31:11Z","timestamp":1784179871000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440626000018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":37,"alternative-id":["S2192440626000018"],"URL":"https:\/\/doi.org\/10.1016\/j.ejco.2026.100127","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Properties of enclosures in multiobjective optimization","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejco.2026.100127","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO).","name":"copyright","label":"Copyright"}],"article-number":"100127"}}