{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T05:57:06Z","timestamp":1776491826820,"version":"3.51.2"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T00:00:00Z","timestamp":1637712000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T00:00:00Z","timestamp":1637712000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["432218631"],"award-info":[{"award-number":["432218631"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>For a continuous multi-objective optimization problem, it is usually not a practical approach to compute all its nondominated points because there are infinitely many of them. For this reason, a typical approach is to compute an approximation of the nondominated set. A common technique for this approach is to generate a polyhedron which contains the nondominated set. However, often these approximations are used for further evaluations. For those applications a polyhedron is a structure that is not easy to handle. In this paper, we introduce an approximation with a simpler structure respecting the natural ordering. In particular, we compute a box-coverage of the nondominated set. To do so, we use an approach that, in general, allows us to update not only one but several boxes whenever a new nondominated point is found. The algorithm is guaranteed to stop with a finite number of boxes, each being sufficiently thin.<\/jats:p>","DOI":"10.1007\/s10898-021-01109-9","type":"journal-article","created":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T05:02:37Z","timestamp":1637730157000},"page":"329-357","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["An approximation algorithm for multi-objective optimization problems using a box-coverage"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1938-6316","authenticated-orcid":false,"given":"Gabriele","family":"Eichfelder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2177-8466","authenticated-orcid":false,"given":"Leo","family":"Warnow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,24]]},"reference":[{"issue":"2","key":"1109_CR1","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1287\/ijoc.1120.0508","volume":"25","author":"R Bokrantz","year":"2013","unstructured":"Bokrantz, R., Forsgren, A.: An algorithm for approximating convex pareto surfaces based on dual techniques. INFORMS J. Comput. 25(2), 377\u2013393 (2013)","journal-title":"INFORMS J. Comput."},{"issue":"5","key":"1109_CR2","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1147\/rd.165.0504","volume":"16","author":"FH Branin","year":"1972","unstructured":"Branin, F.H.: Widely convergent method for finding multiple solutions of simultaneous nonlinear equations. IBM J. Res. Dev. 16(5), 504\u2013522 (1972)","journal-title":"IBM J. Res. Dev."},{"issue":"2","key":"1109_CR3","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/s10957-013-0346-0","volume":"162","author":"RS Burachik","year":"2013","unstructured":"Burachik, R.S., Kaya, C.Y., Rizvi, M.M.: A new scalarization technique to approximate pareto fronts of problems with disconnected feasible sets. J. Optim. Theory Appl. 162(2), 428\u2013446 (2013)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1109_CR4","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1137\/16M1083967","volume":"27","author":"RS Burachik","year":"2017","unstructured":"Burachik, R.S., Kaya, C.Y., Rizvi, M.M.: A new scalarization technique and new algorithms to generate pareto fronts. SIAM J. Optim. 27(2), 1010\u20131034 (2017)","journal-title":"SIAM J. Optim."},{"key":"1109_CR5","unstructured":"Do\u011fan, S., \u00d6zlem, K., Ulus, F.: An exact algorithm for biobjective integer programming problems (2019). https:\/\/arxiv.org\/abs\/1905.07428"},{"issue":"4","key":"1109_CR6","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s10898-014-0205-z","volume":"61","author":"K D\u00e4chert","year":"2014","unstructured":"D\u00e4chert, K., Klamroth, K.: A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems. J. Glob. Optim. 61(4), 643\u2013676 (2014)","journal-title":"J. Glob. Optim."},{"key":"1109_CR7","unstructured":"D\u00e4chert, K., Teichert, K.: An improved hyperboxing algorithm for calculating a Pareto front representation (2020). https:\/\/arxiv.org\/abs\/2003.14249"},{"key":"1109_CR8","doi-asserted-by":"crossref","unstructured":"D\u00f6rfler, D., L\u00f6hne, A., Schneider, C., Wei\u00dfing, B.: A Benson-type algorithm for bounded convex vector optimization problems with vertex selection (2020). http:\/\/arxiv.org\/abs\/2006.15600","DOI":"10.1080\/10556788.2021.1880579"},{"key":"1109_CR9","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer (2005)"},{"issue":"3","key":"1109_CR10","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10957-008-9394-2","volume":"138","author":"M Ehrgott","year":"2008","unstructured":"Ehrgott, M., Ruzika, S.: Improved $$\\varepsilon $$-constraint method for multiobjective programming. J. Optim. Theory Appl. 138(3), 375\u2013396 (2008)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1109_CR11","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10898-010-9588-7","volume":"50","author":"M Ehrgott","year":"2010","unstructured":"Ehrgott, M., Shao, L., Sch\u00f6bel, A.: An approximation algorithm for convex multi-objective programming problems. J. Glob. Optim. 50(3), 397\u2013416 (2010)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1109_CR12","doi-asserted-by":"publisher","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.: A general branch-and-bound framework for continuous global multiobjective optimization. J. Glob. Optim. 80(1), 195\u2013227 (2021)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1109_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10898-019-00815-9","volume":"77","author":"G Eichfelder","year":"2019","unstructured":"Eichfelder, G., Niebling, J., Rockt\u00e4schel, S.: An algorithmic approach to multiobjective optimization with decision uncertainty. J. Glob. Optim. 77(1), 3\u201325 (2019)","journal-title":"J. Glob. Optim."},{"issue":"5","key":"1109_CR14","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1080\/10556788.2013.854357","volume":"29","author":"Y Evtushenko","year":"2013","unstructured":"Evtushenko, Y., Posypkin, M.: A deterministic algorithm for global multi-objective optimization. Optim. Methods Softw. 29(5), 1005\u20131019 (2013)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"1109_CR15","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10589-007-9135-8","volume":"42","author":"J Fern\u00e1ndez","year":"2007","unstructured":"Fern\u00e1ndez, J., T\u00f3th, B.: Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods. Comput. Optim. Appl. 42(3), 393\u2013419 (2007)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"1109_CR16","doi-asserted-by":"publisher","first-page":"2091","DOI":"10.1137\/15M1016424","volume":"26","author":"J Fliege","year":"2016","unstructured":"Fliege, J., Vaz, A.I.F.: A method for constrained multiobjective optimization based on SQP techniques. SIAM J. Optim. 26(4), 2091\u20132119 (2016)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1109_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/evco.1995.3.1.1","volume":"3","author":"CM Fonseca","year":"1995","unstructured":"Fonseca, C.M., Fleming, P.J.: An overview of evolutionary algorithms in multiobjective optimization. Evol. Comput. 3(1), 1\u201316 (1995)","journal-title":"Evol. Comput."},{"key":"1109_CR18","unstructured":"G\u00f6pfert, A., Riahi, H., Tammer, C., Zalinescu, C.: Variational Methods in Partially Ordered Spaces. Springer (2003)"},{"issue":"3","key":"1109_CR19","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/j.orl.2006.03.019","volume":"35","author":"HW Hamacher","year":"2007","unstructured":"Hamacher, H.W., Pedersen, C.R., Ruzika, S.: Finding representative systems for discrete bicriterion optimization problems. Oper. Res. Lett. 35(3), 336\u2013344 (2007)","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"1109_CR20","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.: A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans. Evol. Comput. 10(5), 477\u2013506 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1109_CR21","doi-asserted-by":"publisher","unstructured":"Ide, J., K\u00f6bis, E., Kuroiwa, D., Sch\u00f6bel, A., Tammer, C.: The relationship between multi-objective robustness concepts and set-valued optimization. Fixed Point Theory Appl. 2014(83) (2014). https:\/\/doi.org\/10.1186\/1687-1812-2014-83","DOI":"10.1186\/1687-1812-2014-83"},{"key":"1109_CR22","doi-asserted-by":"crossref","unstructured":"Jamil, M., Yang, X.S.: A literature survey of benchmark functions for global optimization problems. Int. J. Math. Model. Numer. Optim. 4(2), 150\u2013194 (2013)","DOI":"10.1504\/IJMMNO.2013.055204"},{"key":"1109_CR23","unstructured":"Jin, Y., Olhofer, M., Sendhoff, B.: Dynamic weighted aggregation for evolutionary multi-objective optimization: why does it work and how? In: Proceedings of the 3rd annual conference on genetic and evolutionary computation, GECCO\u201901, pp. 1042\u20131049. Morgan Kaufmann Publishers Inc. (2001)"},{"key":"1109_CR24","doi-asserted-by":"crossref","unstructured":"Khan, A.A., Tammer, C., Z\u0103linescu, C.: Set-valued Optimization. Springer (2015)","DOI":"10.1007\/978-3-642-54265-7"},{"issue":"3","key":"1109_CR25","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.: On the representation of the search region in multi-objective optimization. Eur. J. Oper. Res. 245(3), 767\u2013778 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1109_CR26","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s001860200217","volume":"56","author":"K Klamroth","year":"2003","unstructured":"Klamroth, K., Tind, J., Wiecek, M.M.: Unbiased approximation in multicriteria optimization. Math. Methods Oper. Res. (ZOR) 56(3), 413\u2013437 (2003)","journal-title":"Math. Methods Oper. Res. (ZOR)"},{"issue":"3","key":"1109_CR27","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/s10898-016-0425-5","volume":"67","author":"T Kuhn","year":"2016","unstructured":"Kuhn, T., Ruzika, S.: A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions. J. Glob. Optim. 67(3), 581\u2013600 (2016)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"1109_CR28","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s10898-013-0136-0","volume":"60","author":"A L\u00f6hne","year":"2014","unstructured":"L\u00f6hne, A., Rudloff, B., Ulus, F.: Primal and dual approximation algorithms for convex vector optimization problems. J. Glob. Optim. 60(4), 713\u2013736 (2014)","journal-title":"J. Glob. Optim."},{"key":"1109_CR29","unstructured":"MATLAB: Matlab bench documentation. https:\/\/www.mathworks.com\/help\/matlab\/ref\/bench.html. Accessed 25 June 2020"},{"key":"1109_CR30","doi-asserted-by":"crossref","unstructured":"Miettinen, K.: Nonlinear Multiobjective Optimization. Springer (1998)","DOI":"10.1007\/978-1-4615-5563-6"},{"issue":"1","key":"1109_CR31","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1137\/18M1169680","volume":"29","author":"J Niebling","year":"2019","unstructured":"Niebling, J., Eichfelder, G.: A branch-and-bound-based algorithm for nonconvex multiobjective optimization. SIAM J. Optim. 29(1), 794\u2013821 (2019)","journal-title":"SIAM J. Optim."},{"key":"1109_CR32","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M., \u017dilinskas, A., \u017dilinskas, J.: Non-Convex Multi-Objective Optimization. Springer (2017)","DOI":"10.1007\/978-3-319-61007-8"},{"issue":"4","key":"1109_CR33","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/BF00934564","volume":"42","author":"A Pascoletti","year":"1984","unstructured":"Pascoletti, A., Serafini, P.: Scalarizing vector optimization problems. J. Optim. Theory Appl. 42(4), 499\u2013524 (1984)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1109_CR34","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10957-005-5494-4","volume":"126","author":"S Ruzika","year":"2005","unstructured":"Ruzika, S., Wiecek, M.M.: Approximation methods in multiobjective programming. J. Optim. Theory Appl. 126(3), 473\u2013501 (2005)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1109_CR35","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/s11750-009-0105-4","volume":"18","author":"D Scholz","year":"2009","unstructured":"Scholz, D.: The multicriteria big cube small cube method. TOP 18(1), 286\u2013302 (2009)","journal-title":"TOP"},{"issue":"4","key":"1109_CR36","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s10898-013-0102-x","volume":"58","author":"L Shao","year":"2013","unstructured":"Shao, L., Ehrgott, M.: An objective space cut and bound algorithm for convex multiplicative programmes. J. Global Optim. 58(4), 711\u2013728 (2013)","journal-title":"J. Global Optim."},{"key":"1109_CR37","doi-asserted-by":"crossref","unstructured":"Tanaka, M., Watanabe, H., Furukawa, Y., Tanino, T.: GA-based decision support system for multicriteria optimization. In: 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century, vol.\u00a02, pp. 1336\u20131561. IEEE (1995)","DOI":"10.1109\/ICSMC.1995.537993"},{"key":"1109_CR38","unstructured":"Teichert, K.: A hyperboxing pareto approximation method applied to radiofrequency ablationtreatment planning. Ph.D. Thesis, Technical University of Kaiserslautern (2014)"},{"key":"1109_CR39","doi-asserted-by":"publisher","first-page":"104103","DOI":"10.1016\/j.dib.2019.104103","volume":"25","author":"J Thomann","year":"2019","unstructured":"Thomann, J., Eichfelder, G.: Numerical results for the multiobjective trust region algorithm MHT. Data in Brief 25, 104103 (2019)","journal-title":"Data in Brief"},{"key":"1109_CR40","doi-asserted-by":"crossref","unstructured":"Van Veldhuizen, D.A.: Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. Ph.D. Thesis, Air Force Institute of Technology, USA (1999)","DOI":"10.1145\/298151.298382"},{"issue":"1","key":"1109_CR41","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/BF01593807","volume":"12","author":"RE Wendell","year":"1977","unstructured":"Wendell, R.E., Lee, D.N.: Efficiency in multiple objective optimization problems. Math. Program. 12(1), 406\u2013414 (1977)","journal-title":"Math. Program."},{"issue":"7","key":"1109_CR42","doi-asserted-by":"publisher","first-page":"1945","DOI":"10.1007\/s11590-013-0712-8","volume":"8","author":"A \u017dilinskas","year":"2013","unstructured":"\u017dilinskas, A.: A one-step worst-case optimal algorithm for bi-objective univariate optimization. Optim. Lett. 8(7), 1945\u20131960 (2013)","journal-title":"Optim. Lett."},{"issue":"1\u20133","key":"1109_CR43","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.cnsns.2014.08.025","volume":"21","author":"A \u017dilinskas","year":"2015","unstructured":"\u017dilinskas, A., \u017dilinskas, J.: Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems. Commun. Nonlinear Sci. Numer. Simul. 21(1\u20133), 89\u201398 (2015)","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"key":"1109_CR44","doi-asserted-by":"crossref","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms\u2014a comparative case study. In: Parallel Problem Solving from Nature\u2014PPSN V, Lecture Notes in Computer Science, vol. 1498, pp. 292\u2013301. Springer (1998)","DOI":"10.1007\/BFb0056872"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01109-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01109-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01109-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T22:31:32Z","timestamp":1726180292000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01109-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,24]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["1109"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01109-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,24]]},"assertion":[{"value":"29 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}