{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T02:44:49Z","timestamp":1775702689691,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T00:00:00Z","timestamp":1767916800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T00:00:00Z","timestamp":1767916800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100019125","name":"Sorbonne Universit\u00c9","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100019125","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":[[2026,3]]},"DOI":"10.1007\/s10898-025-01586-2","type":"journal-article","created":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T09:29:35Z","timestamp":1767950975000},"page":"667-698","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quadratic convex reformulations for multiObjective binary quadratic programming"],"prefix":"10.1007","volume":"94","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1189-5917","authenticated-orcid":false,"given":"Marianna","family":"De Santis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucas","family":"L\u00e9tocart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,9]]},"reference":[{"issue":"1","key":"1586_CR1","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1080\/0305215X.2020.1853715","volume":"54","author":"L Amorosi","year":"2022","unstructured":"Amorosi, L., Cedola, L., Dell\u2019Olmo, P., Lucchetta, F.: Multi-objective mathematical programming for optimally sizing and managing battery energy storage for solar photovoltaic system integration of a multi-apartment building. Eng. Optim. 54(1), 81\u2013100 (2022)","journal-title":"Eng. Optim."},{"issue":"1","key":"1586_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"F Barahona","year":"1989","unstructured":"Barahona, F., J\u00fcnger, M., Reinelt, G.: Experiments in quadratic 0\u20131 programming. Math. Program. 44(1), 127\u2013137 (1989)","journal-title":"Math. Program."},{"key":"1586_CR3","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10107-005-0637-9","volume":"109","author":"A Billionnet","year":"2007","unstructured":"Billionnet, A., Elloumi, S.: Using a mixed integer quadratic programming solver for the unconstrained quadratic 0\u20131 problem. Math. Program. 109, 55\u201368 (2007)","journal-title":"Math. Program."},{"issue":"1","key":"1586_CR4","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10107-010-0381-7","volume":"131","author":"A Billionnet","year":"2012","unstructured":"Billionnet, A., Elloumi, S., Lambert, A.: Extending the qcr method to general mixed-integer programs. Math. Program. 131(1), 381\u2013401 (2012)","journal-title":"Math. Program."},{"issue":"6","key":"1586_CR5","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1016\/j.dam.2007.12.007","volume":"157","author":"A Billionnet","year":"2009","unstructured":"Billionnet, A., Elloumi, S., Plateau, M.-C.: Improving the performance of standard solvers for quadratic 0\u20131 programs by a tight convex reformulation: The qcr method. Discret. Appl. Math. 157(6), 1185\u20131197 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"1586_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02115753","volume":"33","author":"E Boros","year":"1991","unstructured":"Boros, E., Hammer, P.L.: The max-cut problem and quadratic 0\u20131 optimization; polyhedral aspects, relaxations and bounds. Ann. Oper. Res. 33(3), 151\u2013180 (1991)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"1586_CR7","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s12532-021-00206-w","volume":"14","author":"A Ceselli","year":"2022","unstructured":"Ceselli, A., L\u00e9tocart, L., Traversi, E.: Dantzig-wolfe reformulations for binary quadratic problems. Math. Program. Comput. 14(1), 85\u2013120 (2022)","journal-title":"Math. Program. Comput."},{"key":"1586_CR8","volume-title":"Multiobjective decision making theory and methodology","author":"V Chankong","year":"1983","unstructured":"Chankong, V., Haimes, Y.Y.: Multiobjective decision making theory and methodology. Elsevier Science Publishing, New York (1983)"},{"key":"1586_CR9","doi-asserted-by":"publisher","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)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"1586_CR10","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)","journal-title":"SIAM J. Optim."},{"key":"1586_CR11","doi-asserted-by":"crossref","unstructured":"De Santis, M., Eichfelder, G., Patria, D., Warnow, L.: Using dual relaxations in multiobjective mixed-integer convex quadratic programming. J. Global Optim., (2024)","DOI":"10.1007\/s10898-024-01440-x"},{"issue":"1","key":"1586_CR12","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)","journal-title":"European J. Oper. Res."},{"key":"1586_CR13","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer Science & Business Media, Heidelberg (2005)"},{"issue":"9","key":"1586_CR14","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1016\/j.cor.2005.10.003","volume":"34","author":"M Ehrgott","year":"2007","unstructured":"Ehrgott, M., Gandibleux, X.: Bound sets for biobjective combinatorial optimization problems. Comput. Oper. Res. 34(9), 2674\u20132694 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"1586_CR15","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)","journal-title":"J. Global Optim."},{"key":"1586_CR16","doi-asserted-by":"crossref","unstructured":"Eichfelder, G., Link, M., Volkwein, S., Warnow, L.: An adaptive relaxation-refinement scheme for multi-objective mixed-integer nonconvex optimization. Preprint 27337, Optimization Online, (2024)","DOI":"10.1007\/s12532-025-00299-7"},{"issue":"2","key":"1586_CR17","doi-asserted-by":"publisher","first-page":"1736","DOI":"10.1007\/s10957-023-02285-2","volume":"203","author":"G Eichfelder","year":"2024","unstructured":"Eichfelder, G., Stein, O., Warnow, L.: A solver for multiobjective mixed-integer convex and nonconvex optimization. J. Optim. Theory Appl. 203(2), 1736\u20131766 (2024)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1586_CR18","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)","journal-title":"J. Global Optim."},{"issue":"1","key":"1586_CR19","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. European J. Oper. Res. 310(1), 315\u2013327 (2023)","journal-title":"European J. Oper. Res."},{"key":"1586_CR20","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."},{"key":"1586_CR21","doi-asserted-by":"publisher","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)","journal-title":"Comput. Oper. Res."},{"issue":"5\u20136","key":"1586_CR22","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)","journal-title":"J. Multi-Criteria Decis. Anal."},{"key":"1586_CR23","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":"1586_CR24","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. European J. Oper. Res. 245(3), 767\u2013778 (2015)","journal-title":"European J. Oper. Res."},{"issue":"1","key":"1586_CR25","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 Bioinformatics 19(1), 13 (2018)","journal-title":"BMC Bioinformatics"},{"key":"1586_CR26","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1590\/S0101-74382014000100005","volume":"34","author":"L L\u00e9tocart","year":"2014","unstructured":"L\u00e9tocart, L., Plateau, M.-C., Plateau, G.: An efficient hybrid heuristic method for the 0\u20131 exact k-item quadratic knapsack problem. Pesquisa Operacional 34, 49\u201372 (2014)","journal-title":"Pesquisa Operacional"},{"key":"1586_CR27","doi-asserted-by":"crossref","unstructured":"L\u00e9tocart, L., Wiegele, A.: Exact solution methods for the k-item quadratic knapsack problem. In Combinatorial Optimization: 4th International Symposium, ISCO 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers 4, pages 166\u2013176. Springer, (2016)","DOI":"10.1007\/978-3-319-45587-7_15"},{"issue":"1","key":"1586_CR28","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10898-023-01309-5","volume":"87","author":"M Link","year":"2023","unstructured":"Link, M., Volkwein, S.: Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs. J. Global Optim. 87(1), 97\u2013132 (2023)","journal-title":"J. Global Optim."},{"issue":"2","key":"1586_CR29","first-page":"455","volume":"213","author":"G Mavrotas","year":"2009","unstructured":"Mavrotas, G.: Effective implementation of the $$\\varepsilon $$-constraint method in multi-objective mathematical programming problems. Appl. Math. Comput. 213(2), 455\u2013465 (2009)","journal-title":"Appl. Math. Comput."},{"key":"1586_CR30","doi-asserted-by":"crossref","unstructured":"Pangia, A.C., Wiecek, M.M.: A branch-and-bound algorithm for parametric mixed-binary nonlinear programs. Journal of Global Optimization, 1\u201325, (2024)","DOI":"10.1007\/s10898-024-01447-4"},{"issue":"4","key":"1586_CR31","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. INFORMS J. Comput. 31(4), 805\u2013822 (2019)","journal-title":"INFORMS J. Comput."},{"key":"1586_CR32","doi-asserted-by":"publisher","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)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"1586_CR33","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. European J. Oper. Res. 260(3), 856\u2013872 (2017)","journal-title":"European J. Oper. Res."},{"issue":"1","key":"1586_CR34","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)","journal-title":"Optim. Eng."},{"issue":"5","key":"1586_CR35","doi-asserted-by":"publisher","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), e0196146 (2018)","journal-title":"PLoS ONE"},{"key":"1586_CR36","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Kong, L., Ziyan, W., Liu, S., Cai, Y., Liu, Y.: Ensemble of multi-objective metaheuristic algorithms for multi-objective unconstrained binary quadratic programming problem. Appl. Soft Comput. 81, 105485 (2019)","DOI":"10.1016\/j.asoc.2019.105485"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01586-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-025-01586-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01586-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T01:50:35Z","timestamp":1775699435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-025-01586-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,9]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["1586"],"URL":"https:\/\/doi.org\/10.1007\/s10898-025-01586-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,9]]},"assertion":[{"value":"6 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2026","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":"Competing interests"}},{"value":"During the preparation of this work the authors used ChatGPT solely to refine the grammar and enhance the readability. After using this tool\/service, the authors reviewed and edited the content as needed and take full responsibility for the content of the publication.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration of generative AI and AI-assisted technologies in the writing process"}}]}}