{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T12:03:43Z","timestamp":1773144223531,"version":"3.50.1"},"reference-count":12,"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-0550-7","type":"journal-article","created":{"date-parts":[[2005,2,4]],"date-time":"2005-02-04T15:17:42Z","timestamp":1107530262000},"page":"559-575","source":"Crossref","is-referenced-by-count":85,"title":["A branch-and-cut algorithm for 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","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":"CR2","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"Balas","year":"1980","unstructured":"Balas, E., Zemel, E.: An algorithm for large zero-one knapsack problems. Oper. Res. 28, 1130?1154 (1980)","journal-title":"Oper. Res."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0806023","volume":"6","author":"Coleman","year":"1996","unstructured":"Coleman, T.F., Li, Y.: An interior trust region approach for nonlinear minimization subject to bounds. SIAM J. Optim. 6, 418?445 (1996)","journal-title":"SIAM J. Optim."},{"key":"CR4","unstructured":"GAMS Development Corporation: General Algebraic Modeling System, Version 2.50, 1998"},{"key":"CR5","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":"CR6","unstructured":"ILOG, Inc.: ILOG CPLEX 7.5, User Manual, 2001"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/ijoc.11.2.173","volume":"11","author":"Linderoth","year":"1999","unstructured":"Linderoth, J.T., Savelsbergh, M.W.P.: A computational study of search strategies for mixed integer programming. Informs J. Comput. 11, 173?187 (1999)","journal-title":"Informs J. Comput."},{"key":"CR8","unstructured":"Mathworks, Inc.: MATLAB Optimization Toolbox 2.0, 1998"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"Nemhauser","year":"1994","unstructured":"Nemhauser, G.L., Savelsbergh, M.W.P., Sigismondi, G.S.: MINTO, a Mixed INTeger Optimizer. Oper. Res. Lett. 15, 47?58 (1994)","journal-title":"Oper. Res. Lett."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Glob. Optim. 8, 201?205 (1996)","journal-title":"J. Glob. Optim."},{"key":"CR11","unstructured":"Vandenbussche, D.: Polyhedral Approaches to Solving Nonconvex Quadratic Programs. PhD thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology, 2003"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Vandenbussche, D., Nemhauser, G.L.: A polyhedral study of nonconvex quadratic programs with box constraints. Technical Report TLI-03-04, Georgia Institute of Technology. Math. Prog. 102, 531?557 (2005)","DOI":"10.1007\/s10107-004-0549-0"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0550-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-004-0550-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0550-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T15:44:07Z","timestamp":1586101447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-004-0550-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10,1]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["550"],"URL":"https:\/\/doi.org\/10.1007\/s10107-004-0550-7","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]]}}}