{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T14:08:12Z","timestamp":1774879692685,"version":"3.50.1"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/bf00120662","type":"journal-article","created":{"date-parts":[[2004,11,4]],"date-time":"2004-11-04T04:07:32Z","timestamp":1099541252000},"page":"15-22","source":"Crossref","is-referenced-by-count":365,"title":["Quadratic programming with one negative eigenvalue is NP-hard"],"prefix":"10.1007","volume":"1","author":[{"given":"Panos M.","family":"Pardalos","sequence":"first","affiliation":[]},{"given":"Stephen A.","family":"Vavasis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. and Johnson, D. S. (1979), Computers and Intractability, A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco."},{"key":"CR2","first-page":"1108","volume":"20","author":"M. K. Kozlov","year":"1979","unstructured":"Kozlov, M. K., Tarasov, S. P., and Ha?ijan, L. G. (1979), Polynomial Solvability of Convex Quadratic Programming, Soviet Math. Doklady 20, 1108?111.","journal-title":"Soviet Math. Doklady"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"K. G. Murty","year":"1987","unstructured":"Murty, K. G. and Kabadi, S. N. (1987), Some NP-Complete Problems in Quadratic and Non-linear Programming, Mathematical Programming 39, 117?129.","journal-title":"Mathematical Programming"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Pardalos, P. M. (1990), Polynomial Time Algorithms for Some Classes of Nonconvex Quadratic Problems, To appear in Optimization.","DOI":"10.1080\/02331939008843615"},{"issue":"3","key":"CR5","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/1028106","volume":"28","author":"P. M. Pardalos","year":"1986","unstructured":"Pardalos, P. M. and Rosen, J. B. (1986), Global Concave Minimization: A Bibliographic Survey, SIAM Review 28 (3), 367?379.","journal-title":"SIAM Review"},{"key":"CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0000035","volume-title":"Constrained Global Optimization: Algorithms and Applications","author":"P. M. Pardalos","year":"1987","unstructured":"Pardalos, P. M. and Rosen, J. B. (1987), Constrained Global Optimization: Algorithms and Applications, Lecture Notes in Computer Science 268, Springer-Verlag, Berlin."},{"issue":"1","key":"CR7","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0167-6377(88)90049-1","volume":"7","author":"P. M. Pardalos","year":"1988","unstructured":"Pardalos, P. M. and Schnitger, G. (1988), Checking Local Optimality in Constrained Quadratic Programming is NP-hard, Operations Research Letters 7 (1), 33?35.","journal-title":"Operations Research Letters"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1137\/0203021","volume":"3","author":"S. Sahni","year":"1974","unstructured":"Sahni, S. (1974), Computationally Related Prolems, SIAM J. Comput. 3, 262?279.","journal-title":"SIAM J. Comput."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0020-0190(90)90100-C","volume":"36","author":"S. A. Vavasis","year":"1990","unstructured":"Vavasis, S. A. (1990), Quadratic Programming Is in NP, Inf. Proc. Lett. 36, 73?77.","journal-title":"Inf. Proc. Lett."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00120662.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00120662\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00120662","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T19:40:24Z","timestamp":1585942824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00120662"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991]]}},"alternative-id":["BF00120662"],"URL":"https:\/\/doi.org\/10.1007\/bf00120662","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}