{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T10:03:54Z","timestamp":1780567434886,"version":"3.54.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T00:00:00Z","timestamp":1704153600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T00:00:00Z","timestamp":1704153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["MIUR PRIN 2017KL4EF3"],"award-info":[{"award-number":["MIUR PRIN 2017KL4EF3"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["2020F3NCPX"],"award-info":[{"award-number":["2020F3NCPX"]}],"id":[{"id":"10.13039\/501100003407","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":[[2024,4]]},"DOI":"10.1007\/s10898-023-01336-2","type":"journal-article","created":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T06:03:11Z","timestamp":1704175391000},"page":"947-978","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Constrained multiobjective optimization of expensive black-box functions using a heuristic branch-and-bound approach"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8881-8357","authenticated-orcid":false,"given":"Donald R.","family":"Jones","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alberto","family":"Lovison","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,1,2]]},"reference":[{"key":"1336_CR1","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-030-53956-6_41","volume-title":"Advances in Swarm Intelligence","author":"S Akhmedova","year":"2020","unstructured":"Akhmedova, S., Stanovov, V.: Success-history based parameter adaptation in moea\/d algorithm. In: Tan, Y., Shi, Y., Tuba, M. (eds.) Advances in Swarm Intelligence, pp. 455\u2013462. Springer, Cham (2020) . (ISBN 978-3-030-53956-6)"},{"key":"1336_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10898-015-0270-y","volume":"64","author":"T Akhtar","year":"2016","unstructured":"Akhtar, T., Shoemaker, C.A.: Multi objective optimization of computationally expensive multi-modal functions with rbf surrogates and multi-rule selection. J. Glob. Optim. 64, 17\u201332 (2016)","journal-title":"J. Glob. Optim."},{"key":"1336_CR3","doi-asserted-by":"publisher","unstructured":"Al-Dujaili, A., Suresh, S.: Dividing rectangles attack multi-objective optimization. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 3606\u20133613 (2016). https:\/\/doi.org\/10.1109\/CEC.2016.7744246","DOI":"10.1109\/CEC.2016.7744246"},{"key":"1336_CR4","doi-asserted-by":"publisher","unstructured":"Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable multi-objective optimization test problems. In: Proceedings of the 2002 Congress on Evolutionary Computation. CEC\u201902 (Cat. No.02TH8600), vol. 1, pp. 825\u2013830 (2002). https:\/\/doi.org\/10.1109\/CEC.2002.1007032","DOI":"10.1109\/CEC.2002.1007032"},{"key":"1336_CR5","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1007\/978-3-662-43505-2_49","volume-title":"Multi-Objective Evolutionary Algorithms","author":"K Deb","year":"2015","unstructured":"Deb, K.: Multi-Objective Evolutionary Algorithms, pp. 995\u20131015. Springer, Berlin (2015). https:\/\/doi.org\/10.1007\/978-3-662-43505-2_49 . (ISBN 978-3-662-43505-2)"},{"key":"1336_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.3390\/mca26010005","volume":"26","author":"K Deb","year":"2021","unstructured":"Deb, K., Roy, P.C., Hussein, R.: Surrogate modeling approaches for multiobjective optimization: methods, taxonomy, and results. Math. Comput. Appl. 26, 11 (2021). https:\/\/doi.org\/10.3390\/mca26010005. (ISSN 2297-8747)","journal-title":"Math. Comput. Appl."},{"key":"1336_CR7","doi-asserted-by":"crossref","unstructured":"Fan, Z., Fang, Y., Li, W., Lu, Ji., Cai, X., Wei, C.: A comparative study of constrained multi-objective evolutionary algorithms on constrained multi-objective optimization problems. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 209\u2013216. IEEE (2017)","DOI":"10.1109\/CEC.2017.7969315"},{"key":"1336_CR8","doi-asserted-by":"publisher","unstructured":"Fonseca, C.M., Paquete, L., Lopez-Ibanez, M.: An improved dimension-sweep algorithm for the hypervolume indicator. In: 2006 IEEE International Conference on Evolutionary Computation, pp. 1157\u20131163 (2006).https:\/\/doi.org\/10.1109\/CEC.2006.1688440","DOI":"10.1109\/CEC.2006.1688440"},{"key":"1336_CR9","unstructured":"Gablonsky, J.: Modifications of the DIRECT algorithm. Ph.D. thesis, North Carolina State University, Raleigh, NC, USA (2001). https:\/\/repository.lib.ncsu.edu\/handle\/1840.16\/3920"},{"key":"1336_CR10","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.ins.2014.08.071","volume":"293","author":"I Giagkiozis","year":"2015","unstructured":"Giagkiozis, I., Fleming, P.J.: Methods for multi-objective optimization: an analysis. Inf. Sci. 293, 338\u2013350 (2015)","journal-title":"Inf. Sci."},{"issue":"2","key":"1336_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10898-014-0232-9","volume":"62","author":"ME Hartikainen","year":"2015","unstructured":"Hartikainen, M.E., Lovison, A.: Paint-sicon: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization. J. Glob. Optim. 62(2), 243\u2013261 (2015). https:\/\/doi.org\/10.1007\/s10898-014-0232-9","journal-title":"J. Glob. Optim."},{"key":"1336_CR12","doi-asserted-by":"crossref","unstructured":"Ishibuchi, H., Tsukamoto, N., Nojima, Y.: Evolutionary many-objective optimization: a short review. In: 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence), pp. 2419\u20132426. IEEE (2008)","DOI":"10.1109\/CEC.2008.4631121"},{"key":"1336_CR13","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/0-306-48332-7_93","volume-title":"Encyclopedia of Optimization","author":"DR Jones","year":"2001","unstructured":"Jones, D.R.: Direct global optimization algorithm. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 431\u2013440. Springer, Boston (2001). https:\/\/doi.org\/10.1007\/0-306-48332-7_93"},{"issue":"1","key":"1336_CR14","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00941892","volume":"79","author":"DR Jones","year":"1993","unstructured":"Jones, D.R., Perttunen, C.D., Stuckman, B.E.: Lipschitzian optimization without the Lipschitz constant. J. Optim. Theory Appl. 79(1), 157\u2013181 (1993). https:\/\/doi.org\/10.1007\/BF00941892","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"1336_CR15","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1023\/A:1008306431147","volume":"13","author":"DR Jones","year":"1998","unstructured":"Jones, D.R., Schonlau, M., Welch, W.J.: Efficient global optimization of expensive black-box functions. J. Glob. Optim. 13(4), 455 (1998)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1336_CR16","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/TEVC.2005.851274","volume":"10","author":"J Knowles","year":"2006","unstructured":"Knowles, J.: Parego: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems. IEEE Trans. Evol. Comput. 10(1), 50\u201366 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"1336_CR17","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler, E.L., Wood, D.E.: Branch-and-bound methods: a survey. Oper. Res. 14(4), 699\u2013719 (1966)","journal-title":"Oper. Res."},{"key":"1336_CR18","doi-asserted-by":"crossref","unstructured":"Lovison, A., Hartikainen, M.E.: On generalizing Lipschitz global methods for multiobjective optimization. In: Evolutionary Multi-Criterion Optimization: 8th International Conference, EMO 2015, Guimar\u00e3es, Portugal, March 29\u2013April 1, 2015. Proceedings, Part II 8, pp. 264\u2013278. Springer (2015)","DOI":"10.1007\/978-3-319-15892-1_18"},{"issue":"2","key":"1336_CR19","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10898-020-00942-8","volume":"79","author":"A Lovison","year":"2021","unstructured":"Lovison, A., Miettinen, K.: On the extension of the direct algorithm to multiple objectives. J. Glob. Optim. 79(2), 387\u2013412 (2021). https:\/\/doi.org\/10.1007\/s10898-020-00942-8","journal-title":"J. Glob. Optim."},{"key":"1336_CR20","volume-title":"Nonlinear Multiobjective Optimization","author":"K Miettinen","year":"1999","unstructured":"Miettinen, K.: Nonlinear Multiobjective Optimization, vol. 12. Springer, Berlin (1999)"},{"key":"1336_CR21","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1016\/j.energy.2017.03.047","volume":"126","author":"J Na","year":"2017","unstructured":"Na, J., Lim, Y., Han, C.: A modified DIRECT algorithm for hidden constraints in an LNG process optimization. Energy 126, 488\u2013500 (2017). https:\/\/doi.org\/10.1016\/j.energy.2017.03.047","journal-title":"Energy"},{"key":"1336_CR22","doi-asserted-by":"publisher","unstructured":"Pang, L.M., Ishibuchi, H., Shang, K.: Offline automatic parameter tuning of moea\/d using genetic algorithm. In: 2019 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1889\u20131897 (2019). https:\/\/doi.org\/10.1109\/SSCI44817.2019.9002787","DOI":"10.1109\/SSCI44817.2019.9002787"},{"key":"1336_CR23","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M., \u017dilinskas, A., \u017dilinskas, J.: Multi-objective branch and bound. In: Non-convex Multi-Objective Optimization, pp. 45\u201356 (2017)","DOI":"10.1007\/978-3-319-61007-8_5"},{"issue":"4","key":"1336_CR24","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0041-5553(72)90115-2","volume":"12","author":"SA Piyavskii","year":"1972","unstructured":"Piyavskii, S.A.: An algorithm for finding the absolute extremum of a function. USSR Comput. Math. Math. Phys. 12(4), 57\u201367 (1972)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"3","key":"1336_CR25","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1137\/0709036","volume":"9","author":"B Shubert","year":"1972","unstructured":"Shubert, B.: A sequential method seeking the global maximum of a function. SIAM J. Numer. Anal. 9(3), 379\u2013388 (1972). https:\/\/doi.org\/10.1137\/0709036","journal-title":"SIAM J. Numer. Anal."},{"key":"1336_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-021-01726-z","author":"L Stripinis","year":"2021","unstructured":"Stripinis, L., Paulavi\u010dius, R.: A new DIRECT-GLh algorithm for global optimization with hidden constraints. Optim. Lett. (2021). https:\/\/doi.org\/10.1007\/s11590-021-01726-z","journal-title":"Optim. Lett."},{"key":"1336_CR27","doi-asserted-by":"publisher","unstructured":"Wong, C.S.Y., Al-Dujaili, A., Sundaram, S.: Hypervolume-based DIRECT for multi-objective optimisation. In: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion, GECCO \u201916 Companion, pp. 1201\u20131208, New York, NY, USA (2016). ACM. https:\/\/doi.org\/10.1145\/2908961.2931702","DOI":"10.1145\/2908961.2931702"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01336-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-023-01336-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01336-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T06:27:01Z","timestamp":1730960821000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-023-01336-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,2]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["1336"],"URL":"https:\/\/doi.org\/10.1007\/s10898-023-01336-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,2]]},"assertion":[{"value":"12 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}