{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T02:15:53Z","timestamp":1772936153358,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10107-021-01680-9","type":"journal-article","created":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T14:04:42Z","timestamp":1625580282000},"page":"203-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs"],"prefix":"10.1007","volume":"196","author":[{"given":"Carlos J.","family":"Nohra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arvind U.","family":"Raghunathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2087-9131","authenticated-orcid":false,"given":"Nikolaos V.","family":"Sahinidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"key":"1680_CR1","doi-asserted-by":"crossref","unstructured":"Anderson, E., Bai, Z., Bischof, C., Blackford, S., Dongarra, J., Croz, J.D., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users\u2019 guide, vol.\u00a09. Siam (1999)","DOI":"10.1137\/1.9780898719604"},{"key":"1680_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10107-011-0462-2","volume":"129","author":"X Bao","year":"2011","unstructured":"Bao, X., Sahinidis, N.V., Tawarmalani, M.: Semidefinite relaxations for quadratically constrained quadratic programming: a review and comparisons. Math. Program. 129, 129\u2013157 (2011)","journal-title":"Math. Program."},{"key":"1680_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10589-012-9474-y","volume":"54","author":"A Billionnet","year":"2013","unstructured":"Billionnet, A., Elloumi, S., Lambert, A.: An efficient compact quadratic convex reformulation for general integer quadratic programs. Comput. Optim. Appl. 54, 141\u2013162 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"1680_CR4","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10107-012-0534-y","volume":"141","author":"C Buchheim","year":"2013","unstructured":"Buchheim, C., Wiegele, A.: Semidefinite relaxations for non-convex quadratic mixed-integer programming. Math. Program. 141, 435\u2013452 (2013)","journal-title":"Math. Program."},{"key":"1680_CR5","doi-asserted-by":"publisher","first-page":"1962","DOI":"10.1137\/140960657","volume":"26","author":"H Dong","year":"2016","unstructured":"Dong, H.: Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations. SIAM J. Optim. 26, 1962\u20131985 (2016)","journal-title":"SIAM J. Optim."},{"key":"1680_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10288-006-0011-7","volume":"5","author":"A Faye","year":"2007","unstructured":"Faye, A., Roupin, F.: Partial Lagrangian relaxation for general quadratic programming. 4OR 5, 75\u201388 (2007)","journal-title":"4OR"},{"key":"1680_CR7","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, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"1680_CR8","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, 383\u2013421 (2018)","journal-title":"Math. Program. Comput."},{"key":"1680_CR9","first-page":"53","volume":"25","author":"TC Koopmans","year":"1957","unstructured":"Koopmans, T.C., Beckmann, M.: Assignment problems and the location of economic activities. Econom. J. Econom. Soc. 25, 53\u201376 (1957)","journal-title":"Econom. J. Econom. Soc."},{"key":"1680_CR10","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1080\/10556788.2017.1350178","volume":"33","author":"M K\u0131l\u0131n\u00e7","year":"2019","unstructured":"K\u0131l\u0131n\u00e7, M., Sahinidis, N.V.: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems in BARON. Optim. Methods Softw. 33, 540\u2013562 (2019)","journal-title":"Optim. Methods Softw."},{"key":"1680_CR11","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, 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"1680_CR12","doi-asserted-by":"crossref","unstructured":"Nohra, C.J., Raghunathan, A.U., Sahinidis, N.V.: Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs. SIAM J. Optim. 31, 142\u2013171 (2021)","DOI":"10.1137\/19M1271762"},{"key":"1680_CR13","unstructured":"Nohra, C.J., Raghunathan, A.U., Sahinidis, N.V.: A test set of quadratic, binary quadratic and integer quadratic programs. ftp:\/\/ftp.merl.com\/pub\/raghunathan\/MIQP-TestSet\/"},{"key":"1680_CR14","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02239972","volume":"539","author":"PM Pardalos","year":"1987","unstructured":"Pardalos, P.M., Glick, J.H., Rosen, J.B.: Global minimization of indefinite quadratic problems. Computing 539, 281\u2013291 (1987)","journal-title":"Computing"},{"key":"1680_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01096724","volume":"4","author":"A Phillips","year":"1994","unstructured":"Phillips, A., Rosen, J.: A quadratic assignment formulation of the molecular conformation problem. J. Global Optim. 4, 229\u2013241 (1994)","journal-title":"J. Global Optim."},{"key":"1680_CR16","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10107-010-0340-3","volume":"130","author":"A Saxena","year":"2011","unstructured":"Saxena, A., Bonami, P., Lee, J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations. Math. Program. 130, 359\u2013413 (2011)","journal-title":"Math. Program."},{"key":"1680_CR17","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, Nonconvex Optimization and Its Applications","author":"HD Sherali","year":"1999","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, Nonconvex Optimization and Its Applications, vol. 31. Kluwer, Dordrecht (1999)"},{"key":"1680_CR18","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/PL00011409","volume":"89","author":"HD Sherali","year":"2001","unstructured":"Sherali, H.D., Wang, H.: Global optimization of nonconvex factorable programming problems. Math. Program. 89, 459\u2013478 (2001)","journal-title":"Math. Program."},{"key":"1680_CR19","first-page":"1","volume":"25","author":"N Shor","year":"1987","unstructured":"Shor, N.: Quadratic optimization problems. Sov. J. Comput. Syst. Sci. 25, 1\u201311 (1987)","journal-title":"Sov. J. Comput. Syst. Sci."},{"key":"1680_CR20","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-002-0308-z","volume":"93","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convex extensions and convex envelopes of lsc functions. Math. Program. 93, 247\u2013263 (2002)","journal-title":"Math. Program."},{"key":"1680_CR21","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, 563\u2013591 (2004)","journal-title":"Math. Program."},{"key":"1680_CR22","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-1-4615-2025-2_4","volume-title":"Handbook of Global Optimization","author":"H Tuy","year":"1995","unstructured":"Tuy, H.: DC optimization: theory, methods and algorithms. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, pp. 149\u2013216. Kluwer, Boston (1995)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01680-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01680-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01680-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T23:31:59Z","timestamp":1667863919000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01680-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["1680"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01680-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"27 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}