{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T06:49:05Z","timestamp":1748846945694,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s10898-021-00991-7","type":"journal-article","created":{"date-parts":[[2021,2,5]],"date-time":"2021-02-05T05:53:46Z","timestamp":1612504426000},"page":"503-520","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Nonlinear biobjective optimization: improving the upper envelope using feasible line segments"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5882-6217","authenticated-orcid":false,"given":"Ignacio","family":"Araya","sequence":"first","affiliation":[]},{"given":"Damir","family":"Aliquintui","sequence":"additional","affiliation":[]},{"given":"Franco","family":"Ardiles","sequence":"additional","affiliation":[]},{"given":"Braulio","family":"Lobo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,5]]},"reference":[{"key":"991_CR1","doi-asserted-by":"crossref","unstructured":"Deb, K.: Multi-objective evolutionary algorithms. In: Kacprzyk J., Pedrycz W. (eds.) Springer Handbook of Computational Intelligence. Springer Handbooks. Springer, Berlin, Heidelberg (2015)","DOI":"10.1007\/978-3-662-43505-2_49"},{"key":"991_CR2","volume-title":"Nonlinear Multiobjective Optimization","author":"K Miettinen","year":"2012","unstructured":"Miettinen, K.: Nonlinear Multiobjective Optimization, vol. 12. Springer, Berlin (2012)"},{"key":"991_CR3","volume-title":"Multiobjective Optimization: Principles and Case Studies","author":"Y Collette","year":"2013","unstructured":"Collette, Y., Siarry, P.: Multiobjective Optimization: Principles and Case Studies. Springer, Heidelberg (2013)"},{"issue":"2","key":"991_CR4","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1134\/S0965542513020061","volume":"53","author":"YG Evtushenko","year":"2013","unstructured":"Evtushenko, Y.G., Posypkin, M.A.: Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy. Comput. Math. Math. Phys. 53(2), 144\u2013157 (2013)","journal-title":"Comput. Math. Math. Phys."},{"issue":"1\u20133","key":"991_CR5","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":"991_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61007-8","volume-title":"Non-convex Multi-objective Optimization","author":"PM Pardalos","year":"2017","unstructured":"Pardalos, P.M., \u017dilinskas, A., \u017dilinskas, J.: Non-convex Multi-objective Optimization. Springer, New York (2017)"},{"issue":"1","key":"991_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00158-004-0496-7","volume":"30","author":"G Ruetsch","year":"2005","unstructured":"Ruetsch, G.: An interval algorithm for multi-objective optimization. Struct. Multidiscipl. Optim. 30(1), 27\u201337 (2005)","journal-title":"Struct. Multidiscipl. Optim."},{"issue":"2","key":"991_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10898-006-9132-y","volume":"38","author":"J Fern\u00e1ndez","year":"2007","unstructured":"Fern\u00e1ndez, J., T\u00f3th, B.: Obtaining an outer approximation of the efficient set of nonlinear biobjective problems. J. Glob. Optim. 38(2), 315\u2013331 (2007)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"991_CR9","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10589-007-9135-8","volume":"42","author":"J Fern\u00e1ndez","year":"2009","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 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"991_CR10","doi-asserted-by":"crossref","unstructured":"Kubica, B.J., Wo\u017aniak, A.: Tuning the interval algorithm for seeking Pareto sets of multi-criteria problems. In: Manninen, P., \u00d6ster, P. (eds.) International Workshop on Applied Parallel Computing, pp. 504\u2013517. Springer, New York (2012)","DOI":"10.1007\/978-3-642-36803-5_38"},{"issue":"1","key":"991_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10898-014-0201-3","volume":"64","author":"B Martin","year":"2016","unstructured":"Martin, B., Goldsztejn, A., Granvilliers, L., Jermann, C.: On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach. J. Glob. Optim. 64(1), 3\u201316 (2016)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"991_CR12","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1016\/j.ejor.2016.05.045","volume":"260","author":"B Martin","year":"2017","unstructured":"Martin, B., Goldsztejn, A., Granvilliers, L., Jermann, C.: Constraint propagation using dominance in interval branch & bound for nonlinear biobjective optimization. Eur. J. Oper. Res. 260(3), 934\u2013948 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"991_CR13","unstructured":"Niebling, J., Eichfelder, G.: A branch-and-bound based algorithm for nonconvex multiobjective optimization. SIAM J. Optim. 29(1), 794\u2013821 (2019)"},{"issue":"1","key":"991_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10898-019-00768-z","volume":"75","author":"I Araya","year":"2019","unstructured":"Araya, I., Campusano, J., Aliquintui, D.: Nonlinear biobjective optimization: improvements to interval branch & bound algorithms. J. Glob. Optim. 75(1), 91\u2013110 (2019)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"991_CR15","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s10898-013-0066-x","volume":"58","author":"A Goldsztejn","year":"2014","unstructured":"Goldsztejn, A., Domes, F., Chevalier, B.: First order rejection tests for multiple-objective optimization. J. Glob. Optim. 58(4), 653\u2013672 (2014)","journal-title":"J. Glob. Optim."},{"key":"991_CR16","doi-asserted-by":"publisher","DOI":"10.1201\/9780203026922","volume-title":"Global Optimization using Interval Analysis: Revised and Expanded","author":"E Hansen","year":"2003","unstructured":"Hansen, E., Walster, G.W.: Global Optimization using Interval Analysis: Revised and Expanded, vol. 264. CRC Press, Boca Raton (2003)"},{"key":"991_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0249-6","volume-title":"Applied Interval Analysis","author":"L Jaulin","year":"2001","unstructured":"Jaulin, L., Kieffer, M., Didrit, O., Walter, E.: Applied Interval Analysis. Springer, Berlin (2001)"},{"issue":"2","key":"991_CR18","first-page":"391","volume":"20","author":"S Kutateladze","year":"1979","unstructured":"Kutateladze, S.: Convex e-programming. Sov. Math. Dokl 20(2), 391\u2013393 (1979)","journal-title":"Sov. Math. Dokl"},{"issue":"94720\u20131776","key":"991_CR19","first-page":"11","volume":"754","author":"W Kahan","year":"1996","unstructured":"Kahan, W.: IEEE standard 754 for binary floating-point arithmetic. Lect. Notes Status IEEE 754(94720\u20131776), 11 (1996)","journal-title":"Lect. Notes Status IEEE"},{"issue":"2","key":"991_CR20","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10898-014-0145-7","volume":"60","author":"I Araya","year":"2014","unstructured":"Araya, I., Trombettoni, G., Neveu, B., Chabert, G.: Upper bounding in inner regions for global optimization under inequality constraints. J. Glob. Optim. 60(2), 145\u2013164 (2014)","journal-title":"J. Glob. Optim."},{"key":"991_CR21","doi-asserted-by":"crossref","unstructured":"Araya, I., Trombettoni, G., Neveu, B.: A contractor based on convex interval taylor. In: Beldiceanu, N., Jussien N., Pinson, \u00c9. (eds.) Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, pp. 1\u201316. Springer, New York (2012)","DOI":"10.1007\/978-3-642-29828-8_1"},{"key":"991_CR22","doi-asserted-by":"crossref","unstructured":"Hlad\u00edk, M., Hor\u00e1\u010dek, J.: Interval linear programming techniques in constraint programming and global optimization. In: Ceberio, M., Kreinovich, V. (eds.) Constraint Programming and Decision Making, pp. 47\u201359. Springer, New York (2014)","DOI":"10.1007\/978-3-319-04280-0_6"},{"issue":"5","key":"991_CR23","doi-asserted-by":"publisher","first-page":"2076","DOI":"10.1137\/S0036142903436174","volume":"42","author":"Y Lebbah","year":"2005","unstructured":"Lebbah, Y., Michel, C., Rueher, M., Daney, D., Merlet, J.: Efficient and safe global constraints for handling numerical constraint systems. SIAM J. Numer. Anal. 42(5), 2076\u20132097 (2005)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"991_CR24","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10288-014-0269-0","volume":"13","author":"J Ninin","year":"2015","unstructured":"Ninin, J., Messine, F., Hansen, P.: A reliable affine relaxation method for global optimization. 4OR 13(3), 247\u2013277 (2015)","journal-title":"4OR"},{"issue":"3","key":"991_CR25","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1023\/A:1011451021517","volume":"7","author":"L Jaulin","year":"2001","unstructured":"Jaulin, L.: Reliable minimax parameter estimation. Reliab. Comput. 7(3), 231\u2013246 (2001)","journal-title":"Reliab. Comput."},{"issue":"3","key":"991_CR26","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/990308.990310","volume":"51","author":"DA Spielman","year":"2004","unstructured":"Spielman, D.A., Teng, S.-H.: Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. J. ACM (JACM) 51(3), 385\u2013463 (2004)","journal-title":"J. ACM (JACM)"},{"key":"991_CR27","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1016\/j.artint.2009.03.002","volume":"173","author":"G Chabert","year":"2009","unstructured":"Chabert, G., Jaulin, L.: Contractor programming. Artif. Intell. 173, 1079\u20131100 (2009)","journal-title":"Artif. Intell."},{"key":"991_CR28","unstructured":"Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.-F.: Revising hull and box consistency. In: Int. Conf. on Logic Programming. Citeseer, Las Cruces (1999)"},{"key":"991_CR29","doi-asserted-by":"crossref","unstructured":"Trombettoni, G., Chabert, G.: Constructive interval disjunction. In: Bessi\u00e8re, C. (ed.) Principles and Practice of Constraint Programming (CP 2007), pp. 635\u2013650. Springer, New York (2007)","DOI":"10.1007\/978-3-540-74970-7_45"},{"issue":"3","key":"991_CR30","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1137\/S0036142995281528","volume":"34","author":"T Csendes","year":"1997","unstructured":"Csendes, T., Ratz, D.: Subdivision direction selection in interval methods for global optimization. SIAM J. Numer. Anal. 34(3), 922\u2013938 (1997)","journal-title":"SIAM J. Numer. Anal."},{"key":"991_CR31","unstructured":"Moore, R.: Interval Analysis. Prentice-Hall, Englewood Cliffs (1966)"},{"issue":"3","key":"991_CR32","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10898-017-0569-y","volume":"71","author":"I Araya","year":"2018","unstructured":"Araya, I., Neveu, B.: lSMEAR: a variable selection strategy for interval branch and bound solvers. J. Glob. Optim. 71(3), 483\u2013500 (2018)","journal-title":"J. Glob. Optim."},{"key":"991_CR33","first-page":"171","volume":"1","author":"F Wilcoxon","year":"1970","unstructured":"Wilcoxon, F., Katti, S., Wilcox, R.A.: Critical values and probability levels for the Wilcoxon rank sum test and the Wilcoxon signed rank test. Sel. Tables Math. Stat. 1, 171\u2013259 (1970)","journal-title":"Sel. Tables Math. Stat."},{"issue":"2","key":"991_CR34","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Progr. 91(2), 201\u2013213 (2002)","journal-title":"Math. Progr."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-00991-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-021-00991-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-00991-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T18:26:25Z","timestamp":1614191185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-021-00991-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["991"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-00991-7","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2021,2]]},"assertion":[{"value":"21 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}