{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T12:03:38Z","timestamp":1773144218108,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,10,31]],"date-time":"2007-10-31T00:00:00Z","timestamp":1193788800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s10589-007-9137-6","type":"journal-article","created":{"date-parts":[[2007,10,30]],"date-time":"2007-10-30T16:58:06Z","timestamp":1193763486000},"page":"181-195","source":"Crossref","is-referenced-by-count":61,"title":["Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound"],"prefix":"10.1007","volume":"43","author":[{"given":"Samuel","family":"Burer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dieter","family":"Vandenbussche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,31]]},"reference":[{"issue":"2","key":"9137_CR1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1008240227198","volume":"13","author":"L.T.H. An","year":"1998","unstructured":"An, L.T.H., Tao, P.D.: A branch and bound method via d.c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems. J. Glob. Optim. 13(2), 171\u2013206 (1998)","journal-title":"J. Glob. Optim."},{"issue":"3, Ser. B","key":"9137_CR2","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s101070100255","volume":"91","author":"K. Anstreicher","year":"2002","unstructured":"Anstreicher, K., Brixius, N., Goux, J.-P., Linderoth, J.: Solving large quadratic assignment problems on computational grids. Math. Program. 91(3, Ser. B), 563\u2013588 (2002). ISMP 2000, Part 1 (Atlanta, GA)","journal-title":"Math. Program."},{"issue":"1","key":"9137_CR3","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10589-005-1014-6","volume":"31","author":"S. Braun","year":"2005","unstructured":"Braun, S., Mitchell, J.E.: A semidefinite programming heuristic for quadratic programming problems with complementarity constraints. Comput. Optim. Appl. 31(1), 5\u201329 (2005)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"9137_CR4","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1137\/040609574","volume":"16","author":"S. Burer","year":"2006","unstructured":"Burer, S., Vandenbussche, D.: Solving lift-and-project relaxations of binary integer programs. SIAM J. Optim. 16(3), 726\u2013750 (2006)","journal-title":"SIAM J. Optim."},{"key":"9137_CR5","doi-asserted-by":"crossref","unstructured":"Burer, S., Vandenbussche, D.: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Manuscript, Department of Management Sciences, University of Iowa, Iowa City, IA, USA, June 2005. Revised April 2006 and June 2006. Math. Program. (to appear)","DOI":"10.1007\/s10107-006-0080-6"},{"key":"9137_CR6","doi-asserted-by":"crossref","unstructured":"De Angelis, P., Pardalos, P., Toraldo, G.: Quadratic programming with box constraints. In: Bomze, I.M., Csendes, T., Horst, R., Pardalos, P. (eds.) Developments in Global Optimization, pp. 73\u201394 (1997)","DOI":"10.1007\/978-1-4757-2600-8_5"},{"key":"9137_CR7","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/3-540-06583-0_43","volume-title":"Fifth Conference on Optimization Techniques, Rome, 1973, Part I","author":"F. Giannessi","year":"1973","unstructured":"Giannessi, F., Tomasin, E.: Nonconvex quadratic programs, linear complementarity problems, and integer linear programs. In: Fifth Conference on Optimization Techniques, Rome, 1973, Part I. Lecture Notes in Comput. Sci., vol. 3, pp. 437\u2013449. Springer, Berlin (1973)"},{"key":"9137_CR8","series-title":"Appl. Optim.","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-1-4613-0263-6_8","volume-title":"Trends in Industrial and Applied Mathematics, Amritsar, 2001","author":"N.I.M. Gould","year":"2002","unstructured":"Gould, N.I.M., Toint, P.L.: Numerical methods for large-scale non-convex quadratic programming. In: Trends in Industrial and Applied Mathematics, Amritsar, 2001. Appl. Optim., vol. 72, pp. 149\u2013179. Kluwer Acad., Dordrecht (2002)"},{"issue":"3","key":"9137_CR9","doi-asserted-by":"crossref","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. Naval Res. Logist. 40(3), 373\u2013392 (1993)","journal-title":"Naval Res. Logist."},{"issue":"3","key":"9137_CR10","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1137\/S089547989631442X","volume":"21","author":"C. Helmberg","year":"2000","unstructured":"Helmberg, C.: Fixing variables in semidefinite relaxations. SIAM J. Matrix Anal. Appl. 21(3), 952\u2013969 (2000) (Electronic)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9137_CR11","unstructured":"ILOG, Inc. ILOG CPLEX 9.0, User Manual (2003)"},{"issue":"5","key":"9137_CR12","first-page":"1049","volume":"248","author":"M.K. Kozlov","year":"1979","unstructured":"Kozlov, M.K., Tarasov, S.P., Khachiyan, L.G.: Polynomial solvability of convex quadratic programming. Dokl. Akad. Nauk SSSR 248(5), 1049\u20131051 (1979)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"9137_CR13","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1, 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"9137_CR14","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0898-1221(91)90163-X","volume":"21","author":"P. Pardalos","year":"1991","unstructured":"Pardalos, P.: Global optimization algorithms for linearly constrained indefinite quadratic problems. Comput. Math. Appl. 21, 87\u201397 (1991)","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"9137_CR15","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"P.M. Pardalos","year":"1991","unstructured":"Pardalos, P.M., Vavasis, S.A.: Quadratic programming with one negative eigenvalue is NP-hard. J. Glob. Optim. 1(1), 15\u201322 (1991)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"9137_CR16","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s10107-004-0549-0","volume":"102","author":"D. Vandenbussche","year":"2005","unstructured":"Vandenbussche, D., Nemhauser, G.: A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102(3), 531\u2013557 (2005)","journal-title":"Math. Program."},{"issue":"3","key":"9137_CR17","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s10107-004-0550-7","volume":"102","author":"D. Vandenbussche","year":"2005","unstructured":"Vandenbussche, D., Nemhauser, G.: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Math. Program. 102(3), 559\u2013575 (2005)","journal-title":"Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9137-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9137-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9137-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:34Z","timestamp":1559302594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9137-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,31]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["9137"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9137-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,31]]}}}