{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T12:03:35Z","timestamp":1773144215052,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2004,10,1]],"date-time":"2004-10-01T00:00:00Z","timestamp":1096588800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2005,1]]},"DOI":"10.1007\/s10107-004-0549-0","type":"journal-article","created":{"date-parts":[[2005,2,4]],"date-time":"2005-02-04T10:17:42Z","timestamp":1107512262000},"page":"531-557","source":"Crossref","is-referenced-by-count":48,"title":["A polyhedral study of nonconvex quadratic programs with box constraints"],"prefix":"10.1007","volume":"102","author":[{"given":"Dieter","family":"Vandenbussche","sequence":"first","affiliation":[]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2004,10,1]]},"reference":[{"key":"CR1","first-page":"171","volume":"13","author":"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, 171?206 (1998)","journal-title":"c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems. J. Glob. Optim."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1137\/0128029","volume":"28","author":"Balas","year":"1975","unstructured":"Balas, E.: Nonconvex quadratic programming via generalized polars. SIAM J. Appl. Math. 28, 335?349 (1975)","journal-title":"SIAM J. Appl. Math."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"Crowder","year":"1983","unstructured":"Crowder, H., Johnson, E.L., Padberg, M.W.: Solving large scale zero-one integer programming problems. Oper. Res. 31, 803?834 (1983)","journal-title":"Oper. Res."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1008397325409","volume":"18","author":"Dang","year":"2000","unstructured":"Dang, C., Xu, L.: A barrier function method for the nonconvex quadratic programming problem with box constraints. J. Glob. Optim. 18, 165?188 (2000)","journal-title":"J. Glob. Optim."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"De Angelis, P., Pardalos, P., Toraldo, G.: Quadratic programming with box constraints. In: I.M. Bomze, T. Csendes, R. Horst, P. Pardalos (eds.), Developments in Global Optimization, Kluwer Academic Publishers, 1997, pp. 73?94","DOI":"10.1007\/978-1-4757-2600-8_5"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1287\/moor.27.1.210.335","volume":"27","author":"Farias","year":"2002","unstructured":"de Farias, Jr., I.R., Johnson, G.L.: Nemhauser. Facets of the complementarity knapsack polytope. Math. Oper. Res. 27, 210?226 (2002)","journal-title":"Facets of the complementarity knapsack polytope. Math. Oper. Res."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s10107-003-0420-8","volume":"96","author":"Farias","year":"2003","unstructured":"de Farias, Jr., I.R., Nemhauser, G.L.: A polyhedral study of the cardinality constrained knapsack polytope. Math. Prog. 96, 439?467 (2003)","journal-title":"Math. Prog."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF00939336","volume":"57","author":"Gupta","year":"1988","unstructured":"Gupta, S., Pardalos, P.M.: A note on a quadratic formulation for linear complementarity problems. J. Optim. Theory Appl. 57, 197?202 (1988)","journal-title":"J. Optim. Theory Appl."},{"key":"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":"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, 373?392 (1993)","journal-title":"Nav. Res. Logist."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"Padberg","year":"1989","unstructured":"Padberg, M.: The Boolean quadric polytope: some characteristics, facets and relatives. Math. Program. 45, 139?172 (1989)","journal-title":"Math. Program."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1051\/ro\/197206V200951","volume":"6","author":"Rosenberg","year":"1972","unstructured":"Rosenberg, I.G.: 0-1 optimization and nonlinear programming. Rev. Fran\u00e7caise Automat. Informat. Recherche Op\u00e9rationnelle 6, 95?97 (1972)","journal-title":"Rev. Fran\u00e7caise Automat. Informat. Recherche Op\u00e9rationnelle"},{"key":"CR12","unstructured":"Vandenbussche, D.: Polyhedral Approaches to Solving Nonconvex Quadratic Programs. PhD thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology, 2003"},{"key":"CR13","unstructured":"Vandenbussche, D., Nemhauser, G.L.: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Technical Report TLI-03-05, Georgia Institute of Technology, 2003. To appear in Math. Prog."},{"key":"CR14","unstructured":"Vavasis, S.A.: Nonlinear optimization, Complexity Issues, volume 8 of Internat. Ser. Monogr. Comput. Sci. The Clarendon Press Oxford University Press, New York, 1991"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/A:1008293029350","volume":"13","author":"Yajima","year":"1998","unstructured":"Yajima, Y., Fujie, T.: A polyhedral approach for nonconvex quadratic programming problems with box constraints. J. Glob. Optim. 13, 151?170 (1998)","journal-title":"J. Glob. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0549-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-004-0549-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0549-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:49:57Z","timestamp":1559108997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-004-0549-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10,1]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["549"],"URL":"https:\/\/doi.org\/10.1007\/s10107-004-0549-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,10,1]]}}}