{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T06:09:23Z","timestamp":1781071763924,"version":"3.54.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T00:00:00Z","timestamp":1728518400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T00:00:00Z","timestamp":1728518400000},"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":["Project-ID 432218631"],"award-info":[{"award-number":["Project-ID 432218631"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004271","name":"Sapienza Universit\u00e0 di Roma","doi-asserted-by":"publisher","award":["RM120172A2970290"],"award-info":[{"award-number":["RM120172A2970290"]}],"id":[{"id":"10.13039\/501100004271","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004434","name":"Universit\u00e0 degli Studi di Firenze","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004434","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2025,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We present a branch-and-bound method for multiobjective mixed-integer convex quadratic programs that computes a superset of efficient integer assignments and a coverage of the nondominated set. The method relies on outer approximations of the upper image set of continuous relaxations. These outer approximations are obtained addressing the dual formulations of specific subproblems where the values of certain integer variables are fixed. The devised pruning conditions and a tailored preprocessing phase allow a fast enumeration of the nodes. Despite we do not require any boundedness of the feasible set, we are able to prove that the method stops after having explored a finite number of nodes. Numerical experiments on a broad set of instances with two, three, and four objectives are presented.<\/jats:p>","DOI":"10.1007\/s10898-024-01440-x","type":"journal-article","created":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T08:01:57Z","timestamp":1728547317000},"page":"159-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Using dual relaxations in multiobjective mixed-integer convex quadratic programming"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1189-5917","authenticated-orcid":false,"given":"Marianna","family":"De Santis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1938-6316","authenticated-orcid":false,"given":"Gabriele","family":"Eichfelder","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniele","family":"Patria","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leo","family":"Warnow","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,10,10]]},"reference":[{"issue":"5","key":"1440_CR1","doi-asserted-by":"publisher","first-page":"0196146","DOI":"10.1371\/journal.pone.0196146","volume":"13","author":"H Zhong","year":"2018","unstructured":"Zhong, H., Guan, W., Zhang, W., Jiang, S., Fan, L.: A bi-objective integer programming model for partly-restricted flight departure scheduling. PLOS ONE 13(5), 0196146 (2018). https:\/\/doi.org\/10.1371\/journal.pone.0196146","journal-title":"PLOS ONE"},{"issue":"1","key":"1440_CR2","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s11081-021-09598-z","volume":"23","author":"A-J Ulusoy","year":"2022","unstructured":"Ulusoy, A.-J., Pecci, F., Stoianov, I.: Bi-objective design-for-control of water distribution networks with global bounds. Optim. Eng. 23(1), 527\u2013577 (2022). https:\/\/doi.org\/10.1007\/s11081-021-09598-z","journal-title":"Optim. Eng."},{"key":"1440_CR3","doi-asserted-by":"publisher","first-page":"106181","DOI":"10.1016\/j.cor.2023.106181","volume":"153","author":"F Pecci","year":"2023","unstructured":"Pecci, F., Stoianov, I.: Bounds and convex heuristics for bi-objective optimal experiment design in water networks. Comput. Oper. Res. 153, 106181 (2023). https:\/\/doi.org\/10.1016\/j.cor.2023.106181","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"1440_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1186\/s12859-018-2007-7","volume":"19","author":"A Legendre","year":"2018","unstructured":"Legendre, A., Angel, E., Tahi, F.: Bi-objective integer programming for RNA secondary structure prediction with pseudoknots. BMC Bioinf. 19(1), 13 (2018). https:\/\/doi.org\/10.1186\/s12859-018-2007-7","journal-title":"BMC Bioinf."},{"issue":"3","key":"1440_CR5","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). https:\/\/doi.org\/10.1007\/s10957-005-5494-4","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1440_CR6","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. Global Optim. 80(1), 195\u2013227 (2021). https:\/\/doi.org\/10.1007\/s10898-020-00984-y","journal-title":"J. Global Optim."},{"issue":"2","key":"1440_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10898-021-01109-9","volume":"83","author":"G Eichfelder","year":"2022","unstructured":"Eichfelder, G., Warnow, L.: An approximation algorithm for multi-objective optimization problems using a box-coverage. J. Global Optim. 83(2), 329\u2013357 (2022). https:\/\/doi.org\/10.1007\/s10898-021-01109-9","journal-title":"J. Global Optim."},{"key":"1440_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-023-02285-2","author":"G Eichfelder","year":"2023","unstructured":"Eichfelder, G., Stein, O., Warnow, L.: A solver for multiobjective mixed-integer convex and nonconvex optimization. J. Optim. Theory Appl. (2023). https:\/\/doi.org\/10.1007\/s10957-023-02285-2","journal-title":"J. Optim. Theory Appl."},{"key":"1440_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-023-00828-x","author":"G Eichfelder","year":"2023","unstructured":"Eichfelder, G., Warnow, L.: A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems. Math. Methods Oper. Res. (2023). https:\/\/doi.org\/10.1007\/s00186-023-00828-x","journal-title":"Math. Methods Oper. Res."},{"issue":"1","key":"1440_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ejor.2019.10.034","volume":"283","author":"M De Santis","year":"2020","unstructured":"De Santis, M., Grani, G., Palagi, L.: Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming. European J. Oper. Res. 283(1), 57\u201369 (2020). https:\/\/doi.org\/10.1016\/j.ejor.2019.10.034","journal-title":"European J. Oper. Res."},{"key":"1440_CR11","doi-asserted-by":"publisher","first-page":"106012","DOI":"10.1016\/j.cor.2022.106012","volume":"148","author":"N Forget","year":"2022","unstructured":"Forget, N., Gadegaard, S.L., Klamroth, K., Nielsen, L.R., Przybylski, A.: Branch-and-bound and objective branching with three or more objectives. Comput. Oper. Res. 148, 106012 (2022). https:\/\/doi.org\/10.1016\/j.cor.2022.106012","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"1440_CR12","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1287\/ijoc.2018.0856","volume":"31","author":"SN Parragh","year":"2019","unstructured":"Parragh, S.N., Tricoire, F.: Branch-and-bound for bi-objective integer programming. Inf. J. Comput. 31(4), 805\u2013822 (2019). https:\/\/doi.org\/10.1287\/ijoc.2018.0856","journal-title":"Inf. J. Comput."},{"issue":"4","key":"1440_CR13","doi-asserted-by":"publisher","first-page":"3122","DOI":"10.1137\/19m1264709","volume":"30","author":"M De Santis","year":"2020","unstructured":"De Santis, M., Eichfelder, G., Niebling, J., Rockt\u00e4schel, S.: Solving multiobjective mixed integer convex optimization problems. SIAM J. Optim. 30(4), 3122\u20133145 (2020). https:\/\/doi.org\/10.1137\/19m1264709","journal-title":"SIAM J. Optim."},{"key":"1440_CR14","unstructured":"Jayasekara Merenchige, P.L.W., Wiecek, M.: A branch and bound algorithm for biobjective mixed integer quadratic programs. Preprint 21294, Optimization Online (2022)"},{"issue":"3","key":"1440_CR15","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). https:\/\/doi.org\/10.1016\/j.ejor.2017.01.032","journal-title":"Eur. J. Oper. Res."},{"issue":"5\u20136","key":"1440_CR16","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1002\/mcda.1780","volume":"29","author":"P Halffmann","year":"2022","unstructured":"Halffmann, P., Sch\u00e4fer, L.E., D\u00e4chert, K., Klamroth, K., Ruzika, S.: Exact algorithms for multiobjective linear optimization problems with integer variables: A state of the art survey. J. Multi-Criteria Decis. Anal. 29(5\u20136), 341\u2013363 (2022). https:\/\/doi.org\/10.1002\/mcda.1780","journal-title":"J. Multi-Criteria Decis. Anal."},{"issue":"2","key":"1440_CR17","doi-asserted-by":"publisher","first-page":"1507","DOI":"10.1007\/s10479-020-03910-3","volume":"319","author":"G Cabrera-Guerrero","year":"2022","unstructured":"Cabrera-Guerrero, G., Ehrgott, M., Mason, A.J., Raith, A.: Bi-objective optimisation over a set of convex sub-problems. Ann. Oper. Res. 319(2), 1507\u20131532 (2022). https:\/\/doi.org\/10.1007\/s10479-020-03910-3","journal-title":"Ann. Oper. Res."},{"key":"1440_CR18","doi-asserted-by":"publisher","first-page":"105396","DOI":"10.1016\/j.cor.2021.105396","volume":"134","author":"M De Santis","year":"2021","unstructured":"De Santis, M., Eichfelder, G.: A decision space algorithm for multiobjective convex quadratic integer optimization. Comput. Oper. Res. 134, 105396 (2021). https:\/\/doi.org\/10.1016\/j.cor.2021.105396","journal-title":"Comput. Oper. Res."},{"key":"1440_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-27659-9","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/3-540-27659-9"},{"issue":"1","key":"1440_CR20","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ejor.2023.02.032","volume":"310","author":"G Eichfelder","year":"2023","unstructured":"Eichfelder, G., Warnow, L.: Advancements in the computation of enclosures for multi-objective optimization problems. Eur. J. Oper. Res. 310(1), 315\u2013327 (2023). https:\/\/doi.org\/10.1016\/j.ejor.2023.02.032","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"1440_CR21","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). https:\/\/doi.org\/10.1016\/j.ejor.2015.03.031","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"1440_CR22","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.orl.2015.05.001","volume":"43","author":"C Buchheim","year":"2015","unstructured":"Buchheim, C., De Santis, M., Palagi, L.: A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations. Oper. Res. Lett. 43(4), 384\u2013388 (2015). https:\/\/doi.org\/10.1016\/j.orl.2015.05.001","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1440_CR23","doi-asserted-by":"publisher","first-page":"1867","DOI":"10.1137\/120878495","volume":"23","author":"C Buchheim","year":"2013","unstructured":"Buchheim, C., De Santis, M., Palagi, L., Piacentini, M.: An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations. SIAM J. Optim. 23(3), 1867\u20131889 (2013). https:\/\/doi.org\/10.1137\/120878495","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1440_CR24","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10107-011-0475-x","volume":"135","author":"C Buchheim","year":"2012","unstructured":"Buchheim, C., Caprara, A., Lodi, A.: An effective branch-and-bound algorithm for convex quadratic integer programming. Math. Program. 135(1\u20132), 369\u2013395 (2012). https:\/\/doi.org\/10.1007\/s10107-011-0475-x","journal-title":"Math. Program."},{"issue":"3","key":"1440_CR25","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1137\/140978971","volume":"26","author":"C Buchheim","year":"2016","unstructured":"Buchheim, C., De Santis, M., Lucidi, S., Rinaldi, F., Trieu, L.: A feasible active set method with reoptimization for convex quadratic mixed-integer programming. SIAM J. Optim. 26(3), 1695\u20131714 (2016). https:\/\/doi.org\/10.1137\/140978971","journal-title":"SIAM J. Optim."},{"key":"1440_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-40065-5","volume-title":"Numerical Optimization","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (1999). https:\/\/doi.org\/10.1007\/978-0-387-40065-5"},{"key":"1440_CR27","unstructured":"Eichfelder, G., Warnow, L.: AdEnA. https:\/\/github.com\/LeoWarnow\/AdEnA. Accessed 2023-09-20 (2023)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01440-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-024-01440-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01440-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T03:23:14Z","timestamp":1746847394000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-024-01440-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,10]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["1440"],"URL":"https:\/\/doi.org\/10.1007\/s10898-024-01440-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,10]]},"assertion":[{"value":"11 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare they have no financial interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}