{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T06:48:39Z","timestamp":1748846919416,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T00:00:00Z","timestamp":1554681600000},"content-version":"tdm","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":[[2019,9]]},"DOI":"10.1007\/s10898-019-00768-z","type":"journal-article","created":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T06:02:41Z","timestamp":1554703361000},"page":"91-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Nonlinear biobjective optimization: improvements to interval branch & bound algorithms"],"prefix":"10.1007","volume":"75","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5882-6217","authenticated-orcid":false,"given":"Ignacio","family":"Araya","sequence":"first","affiliation":[]},{"given":"Jose","family":"Campusano","sequence":"additional","affiliation":[]},{"given":"Damir","family":"Aliquintui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,8]]},"reference":[{"issue":"6","key":"768_CR1","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s00158-003-0368-6","volume":"26","author":"RT Marler","year":"2004","unstructured":"Marler, R.T., Arora, J.S.: Survey of multi-objective optimization methods for engineering. Struct. Multidiscipl. Optim. 26(6), 369\u2013395 (2004)","journal-title":"Struct. Multidiscipl. Optim."},{"key":"768_CR2","doi-asserted-by":"crossref","unstructured":"Deb, K.: Multi-objective optimization. In: Search Methodologies. Springer, pp. 403\u2013449 (2014)","DOI":"10.1007\/978-1-4614-6940-7_15"},{"issue":"3","key":"768_CR3","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1016\/j.ejor.2017.01.032","volume":"260","author":"A Przybylski","year":"2017","unstructured":"Przybylski, A., Gandibleux, X.: Multi-objective branch and bound. Eur. J. Oper. Res. 260(3), 856\u2013872 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"768_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s00186-016-0560-2","volume":"85","author":"JL Redondo","year":"2017","unstructured":"Redondo, J.L., Fern\u00e1ndez, J., Ortigosa, P.M.: FEMOEA: a fast and efficient multi-objective evolutionary algorithm. Math. Methods Oper. Res. 85(1), 113\u2013135 (2017)","journal-title":"Math. Methods Oper. Res."},{"key":"768_CR5","volume-title":"Evolutionary Algorithms for Solving Multi-objective Problems","author":"CAC Coello","year":"2007","unstructured":"Coello, C.A.C., Lamont, G.B., Van Veldhuizen, D.A., et al.: Evolutionary Algorithms for Solving Multi-objective Problems, vol. 5. Springer, Berlin (2007)"},{"issue":"1","key":"768_CR6","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. Multidiscip. Optim. 30(1), 27\u201337 (2005)","journal-title":"Struct. Multidiscip. Optim."},{"issue":"2","key":"768_CR7","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":"768_CR8","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":"768_CR9","doi-asserted-by":"crossref","unstructured":"Kubica, B.\u00a0J., Wo\u017aniak, A.: Tuning the interval algorithm for seeking pareto sets of multi-criteria problems. In: International Workshop on Applied Parallel Computing. Springer, pp. 504\u2013517 (2012)","DOI":"10.1007\/978-3-642-36803-5_38"},{"issue":"1","key":"768_CR10","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":"768_CR11","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":"768_CR12","doi-asserted-by":"crossref","unstructured":"Niebling, J., Eichfelder, G.: A branch-and-bound based algorithm for nonconvex multiobjective optimization. Preprint-Series of the Institute for Mathematics (2018)","DOI":"10.1137\/18M1169680"},{"issue":"4","key":"768_CR13","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."},{"issue":"2","key":"768_CR14","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":"768_CR15","doi-asserted-by":"crossref","unstructured":"Trombettoni, G., Araya, I., Neveu, B., Chabert, G.: Inner regions and interval linearizations for global optimization. In: AAAI Conference on Artificial Intelligence, pp. 99\u2013104 (2011)","DOI":"10.1609\/aaai.v25i1.7817"},{"issue":"3","key":"768_CR16","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":"768_CR17","unstructured":"Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.-F.: Revising hull and box consistency. In: International Conference on Logic Programming, Citeseer (1999)"},{"key":"768_CR18","doi-asserted-by":"crossref","unstructured":"Neveu, B., Trombettoni, G., et\u00a0al.: Adaptive constructive interval disjunction. In: International Conference on Tools with Artificial Intelligence (ICTAI), pp. 900\u2013906 (2013)","DOI":"10.1109\/ICTAI.2013.138"},{"issue":"3","key":"768_CR19","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"},{"key":"768_CR20","doi-asserted-by":"crossref","unstructured":"Araya, I., Trombettoni, G., Neveu, B.: A contractor based on convex interval taylor. In: Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems. Springer, pp. 1\u201316 (2012)","DOI":"10.1007\/978-3-642-29828-8_1"},{"key":"768_CR21","unstructured":"Martin, B.: Rigorous algorithms for nonlinear biobjective optimization. Ph.D. dissertation, Universit\u00e9 de Nantes (2014)"},{"key":"768_CR22","volume-title":"Interval Methods for Single and Bi-objective Optimization Problems-Applied to Competitive Facility Location Problems","author":"B T\u00f3th","year":"2010","unstructured":"T\u00f3th, B., Fern\u00e1ndez, J.: Interval Methods for Single and Bi-objective Optimization Problems-Applied to Competitive Facility Location Problems. Lambert Academic Publishing, Saarbr\u00fccken (2010)"},{"key":"768_CR23","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":"768_CR24","doi-asserted-by":"crossref","unstructured":"Trombettoni, G., Chabert, G.: Constructive interval disjunction. In: Principles and Practice of Constraint Programming (CP 2007). Springer, pp. 635\u2013650 (2007)","DOI":"10.1007\/978-3-540-74970-7_45"},{"issue":"3","key":"768_CR25","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":"768_CR26","volume-title":"Interval Analysis","author":"RE Moore","year":"1966","unstructured":"Moore, R.E.: Interval Analysis. Prentice-Hall, Englewood Cliffs, NJ (1966)"},{"key":"768_CR27","doi-asserted-by":"crossref","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms: a comparative case study. In: International Conference on Parallel Problem Solving from Nature. Springer, pp. 292\u2013301 (1998)","DOI":"10.1007\/BFb0056872"},{"issue":"2","key":"768_CR28","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10898-015-0375-3","volume":"64","author":"B Neveu","year":"2016","unstructured":"Neveu, B., Trombettoni, G., Araya, I.: Node selection strategies in interval branch and bound algorithms. J. Glob. Optim. 64(2), 289\u2013304 (2016)","journal-title":"J. Glob. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00768-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00768-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00768-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T12:12:55Z","timestamp":1663243975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00768-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,8]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["768"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00768-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2019,4,8]]},"assertion":[{"value":"12 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}