{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T12:36:43Z","timestamp":1771850203695,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T00:00:00Z","timestamp":1730764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T00:00:00Z","timestamp":1730764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s12532-024-00270-y","type":"journal-article","created":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T07:07:13Z","timestamp":1730790433000},"page":"231-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fix and bound: an efficient approach for solving large-scale quadratic programming problems with box constraints"],"prefix":"10.1007","volume":"17","author":[{"given":"Marco","family":"Locatelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Veronica","family":"Piccialli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio M.","family":"Sudoso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,5]]},"reference":[{"issue":"1","key":"270_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F Alizadeh","year":"1995","unstructured":"Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5(1), 13\u201351 (1995)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"270_CR2","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"KM Anstreicher","year":"2009","unstructured":"Anstreicher, K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Global Optim. 43(2), 471\u2013484 (2009)","journal-title":"J. Global Optim."},{"issue":"2","key":"270_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"IM Bomze","year":"2002","unstructured":"Bomze, I.M., De Klerk, E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Global Optim. 24(2), 163\u2013185 (2002)","journal-title":"J. Global Optim."},{"issue":"3","key":"270_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s12532-018-0133-x","volume":"10","author":"P Bonami","year":"2018","unstructured":"Bonami, P., G\u00fcnl\u00fck, O., Linderoth, J.: Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods. Math. Program. Comput. 10(3), 333\u2013382 (2018)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"270_CR5","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120(2), 479\u2013495 (2009)","journal-title":"Math. Program."},{"issue":"1","key":"270_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-010-0010-8","volume":"2","author":"S Burer","year":"2010","unstructured":"Burer, S.: Optimizing a polyhedral-semidefinite relaxation of completely positive programs. Math. Program. Comput. 2(1), 1\u201319 (2010)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"270_CR7","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/080729529","volume":"20","author":"S Burer","year":"2009","unstructured":"Burer, S., Letchford, A.N.: On nonconvex quadratic programming with box constraints. SIAM J. Optim. 20(2), 1073\u20131089 (2009)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"270_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10589-007-9137-6","volume":"43","author":"S Burer","year":"2009","unstructured":"Burer, S., Vandenbussche, D.: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound. Comput. Optim. Appl. 43(2), 181\u2013195 (2009)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"270_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10107-008-0263-4","volume":"125","author":"A Caprara","year":"2010","unstructured":"Caprara, A., Locatelli, M.: Global optimization problems and domain reduction strategies. Math. Program. 125(1), 123\u2013137 (2010)","journal-title":"Math. Program."},{"key":"270_CR10","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10288-020-00454-x","volume":"19","author":"M Cerulli","year":"2021","unstructured":"Cerulli, M., De Santis, M., Gaar, E., Wiegele, A.: Improving admms for solving doubly nonnegative programs through dual factorization. 4OR. 19, 415\u2013448 (2021)","journal-title":"4OR."},{"issue":"1","key":"270_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s12532-011-0033-9","volume":"4","author":"J Chen","year":"2012","unstructured":"Chen, J., Burer, S.: Globally solving nonconvex quadratic programming problems via completely positive programming. Math. Program. Comput. 4(1), 33\u201352 (2012)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"270_CR12","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. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"1","key":"270_CR13","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1080\/10556788.2017.1350675","volume":"34","author":"S Elloumi","year":"2019","unstructured":"Elloumi, S., Lambert, A.: Global solution of non-convex quadratically constrained quadratic programs. Optim. Methods Softw. 34(1), 98\u2013114 (2019)","journal-title":"Optim. Methods Softw."},{"issue":"5","key":"270_CR14","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.orl.2018.08.005","volume":"46","author":"L Galli","year":"2018","unstructured":"Galli, L., Letchford, A.N.: A binarisation heuristic for non-convex quadratic programming with box constraints. Oper. Res. Lett. 46(5), 529\u2013533 (2018)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"270_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/S0036144504446096","volume":"47","author":"PE Gill","year":"2005","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: Snopt: An sqp algorithm for large-scale constrained optimization. SIAM Review 47(1), 99\u2013131 (2005)","journal-title":"SIAM Review"},{"issue":"4","key":"270_CR16","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s10898-016-0450-4","volume":"67","author":"AM Gleixner","year":"2017","unstructured":"Gleixner, A.M., Berthold, T., M\u00fcller, B., Weltge, S.: Three enhancements for optimization-based bound tightening. J. Global Optim. 67(4), 731\u2013757 (2017)","journal-title":"J. Global Optim."},{"issue":"6","key":"270_CR17","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"issue":"2","key":"270_CR18","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10898-021-01017-y","volume":"81","author":"J Gondzio","year":"2021","unstructured":"Gondzio, J., Y\u0131ld\u0131r\u0131m, E.A.: Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations. J. Global Optim. 81(2), 293\u2013321 (2021)","journal-title":"J. Global Optim."},{"issue":"2","key":"270_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3514039","volume":"48","author":"N Gusmeroli","year":"2022","unstructured":"Gusmeroli, N., Hrga, T., Lu\u017ear, B., Povh, J., Siebenhofer, M., Wiegele, A.: Biqbin: a parallel branch-and-bound solver for binary quadratic problems with linear constraints. ACM Trans. Math. Softw. 48(2), 1\u201331 (2022)","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"270_CR20","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1002\/1520-6750(199304)40:3<373::AID-NAV3220400307>3.0.CO;2-A","volume":"40","author":"P Hansen","year":"1993","unstructured":"Hansen, P., Jaumard, B., Ruiz, M., Xiong, J.: Global minimization of indefinite quadratic functions subject to box constraints. Nav. Res. Logist. 40(3), 373\u2013392 (1993)","journal-title":"Nav. Res. Logist."},{"issue":"1","key":"270_CR21","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/050622870","volume":"46","author":"C Jansson","year":"2008","unstructured":"Jansson, C., Chaykin, D., Keil, C.: Rigorous error bounds for the optimal value in semidefinite programming. SIAM J. Numer. Anal. 46(1), 180\u2013200 (2008)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"270_CR22","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s12532-018-0138-5","volume":"10","author":"A Khajavirad","year":"2018","unstructured":"Khajavirad, A., Sahinidis, N.V.: A hybrid lp\/nlp paradigm for global optimization relaxations. Math. Program. Comput. 10(3), 383\u2013421 (2018)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"270_CR23","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1080\/10556788.2017.1341504","volume":"34","author":"G Liuzzi","year":"2019","unstructured":"Liuzzi, G., Locatelli, M., Piccialli, V.: A new branch-and-bound algorithm for standard quadratic programming problems. Optim. Methods Softw. 34(1), 79\u201397 (2019)","journal-title":"Optim. Methods Softw."},{"issue":"6","key":"270_CR24","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.1007\/s11590-021-01846-6","volume":"16","author":"G Liuzzi","year":"2022","unstructured":"Liuzzi, G., Locatelli, M., Piccialli, V.: A computational study on qp problems with general linear constraints. Optim. Lett. 16(6), 1633\u20131647 (2022)","journal-title":"Optim. Lett."},{"issue":"3","key":"270_CR25","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s10589-021-00282-7","volume":"79","author":"G Liuzzi","year":"2021","unstructured":"Liuzzi, G., Locatelli, M., Piccialli, V., Rass, S.: Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems. Comput. Optim. Appl. 79(3), 561\u2013599 (2021)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"270_CR26","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part i-convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"270_CR27","doi-asserted-by":"publisher","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of tur\u00e1n. Can. J. Math. 17, 533\u2013540 (1965)","journal-title":"Can. J. Math."},{"issue":"1","key":"270_CR28","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1137\/19M1271762","volume":"31","author":"CJ Nohra","year":"2021","unstructured":"Nohra, C.J., Raghunathan, A.U., Sahinidis, N.: Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs. SIAM J. Optim. 31(1), 142\u2013171 (2021)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"270_CR29","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M Padberg","year":"1989","unstructured":"Padberg, M.: The boolean quadric polytope: some characteristics, facets and relatives. Math. Program. 45(1), 139\u2013172 (1989)","journal-title":"Math. Program."},{"issue":"3","key":"270_CR30","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s11590-017-1132-y","volume":"12","author":"J Park","year":"2018","unstructured":"Park, J., Boyd, S.: A semidefinite programming method for integer convex quadratic minimization. Optim. Lett. 12(3), 499\u2013518 (2018)","journal-title":"Optim. Lett."},{"key":"270_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105958","volume":"147","author":"V Piccialli","year":"2022","unstructured":"Piccialli, V., Russo Russo, A., Sudoso, A.M.: An exact algorithm for semi-supervised minimum sum-of-squares clustering. Comput. Oper. Res. 147, 105958 (2022)","journal-title":"Comput. Oper. Res."},{"key":"270_CR32","doi-asserted-by":"crossref","unstructured":"Piccialli, V., Sudoso, A.M.: Global optimization for cardinality-constrained minimum sum-of-squares clustering via semidefinite programming. Math. Program. pp. 1\u201335 (2023)","DOI":"10.1007\/s10107-023-02021-8"},{"issue":"4","key":"270_CR33","doi-asserted-by":"publisher","first-page":"2144","DOI":"10.1287\/ijoc.2022.1166","volume":"34","author":"V Piccialli","year":"2022","unstructured":"Piccialli, V., Sudoso, A.M., Wiegele, A.: SOS-SDP: An exact solver for minimum sum-of-squares clustering. INFORMS J. Comput. 34(4), 2144\u20132162 (2022)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"270_CR34","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: BARON: A general purpose global optimization software package. J. Global Optim. 8(2), 201\u2013205 (1996)","journal-title":"J. Global Optim."},{"key":"270_CR35","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: Baron: A general purpose global optimization software package. J. Global Optim. 8, 201\u2013205 (1996)","journal-title":"J. Global Optim."},{"issue":"1","key":"270_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"HD Sherali","year":"1995","unstructured":"Sherali, H.D., Tuncbilek, C.H.: A reformulation-convexification approach for solving nonconvex quadratic programming problems. J. Global Optim. 7(1), 1\u201331 (1995)","journal-title":"J. Global Optim."},{"key":"270_CR37","first-page":"1","volume":"25","author":"NZ Shor","year":"1987","unstructured":"Shor, N.Z.: Quadratic optimization problems. Sov. J. Comput. Syst. Sci. 25, 1\u201311 (1987)","journal-title":"Sov. J. Comput. Syst. Sci."},{"issue":"2","key":"270_CR38","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1137\/140964357","volume":"25","author":"D Sun","year":"2015","unstructured":"Sun, D., Toh, K.C., Yang, L.: A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints. SIAM J. Optim. 25(2), 882\u2013915 (2015)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"270_CR39","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1080\/10556788.2019.1576176","volume":"35","author":"D Sun","year":"2020","unstructured":"Sun, D., Toh, K.C., Yuan, Y., Zhao, X.Y.: SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0). Optim. Methods Softw. 35(1), 87\u2013115 (2020)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"270_CR40","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: A theoretical and computational study. Math. Program. 99(3), 563\u2013591 (2004)","journal-title":"Math. Program."},{"key":"270_CR41","unstructured":"Wiegele, A.: Biq mac library (2007). https:\/\/biqmac.aau.at\/biqmaclib.html"},{"issue":"1","key":"270_CR42","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1287\/ijoc.2018.0883","volume":"32","author":"W Xia","year":"2020","unstructured":"Xia, W., Vera, J.C., Zuluaga, L.F.: Globally solving nonconvex quadratic programs via linear integer programming techniques. INFORMS J. Comput. 32(1), 40\u201356 (2020)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"270_CR43","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/A:1008293029350","volume":"13","author":"Y Yajima","year":"1998","unstructured":"Yajima, Y., Fujie, T.: A polyhedral approach for nonconvex quadratic programming problems with box constraints. J. Global Optim. 13(2), 151\u2013170 (1998)","journal-title":"J. Global Optim."},{"issue":"3","key":"270_CR44","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s12532-015-0082-6","volume":"7","author":"L Yang","year":"2015","unstructured":"Yang, L., Sun, D., Toh, K.C.: SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints. Math. Program. Comput. 7(3), 331\u2013366 (2015)","journal-title":"Math. Program. Comput."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-024-00270-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-024-00270-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-024-00270-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T12:03:04Z","timestamp":1747396984000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-024-00270-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,5]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["270"],"URL":"https:\/\/doi.org\/10.1007\/s12532-024-00270-y","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,5]]},"assertion":[{"value":"16 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}