{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:34:27Z","timestamp":1759847667175},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,10,21]],"date-time":"2006-10-21T00:00:00Z","timestamp":1161388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,10,21]],"date-time":"2006-10-21T00:00:00Z","timestamp":1161388800000},"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":[[2007,9]]},"DOI":"10.1007\/s10107-006-0047-7","type":"journal-article","created":{"date-parts":[[2006,10,20]],"date-time":"2006-10-20T09:33:16Z","timestamp":1161336796000},"page":"641-649","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Quadratic programming and combinatorial minimum weight product problems"],"prefix":"10.1007","volume":"110","author":[{"given":"Walter","family":"Kern","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,21]]},"reference":[{"key":"47_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R. Ahuja","year":"1993","unstructured":"Ahuja R., Magnanti T., Orlin J. (1993) Network Flows: Theory, Algorithms and Applications. Prentice Hall, New Jersey"},{"key":"47_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-7600-2","volume-title":"Generalized Convexity","author":"M. Avriel","year":"1988","unstructured":"Avriel M., Dievert W.E., Schaible S., Zhang I. (1988) Generalized Convexity. Plenum, New York"},{"key":"47_CR3","volume-title":"Principles of Mathematical Programming","author":"U. Faigle","year":"2001","unstructured":"Faigle U., Kern W., Still G. (2001)Algorithmic Principles of Mathematical Programming. Kluwer, Dordrecht"},{"key":"47_CR4","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey M., Johnson D. (1979) Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, San Francisco"},{"key":"47_CR5","volume-title":"Sensitivity analysis for combinatorial optimization. Memorandum UCB\/ERL M80\/22","author":"D. Gusfield","year":"1980","unstructured":"Gusfield D. (1980) Sensitivity analysis for combinatorial optimization. Memorandum UCB\/ERL M80\/22. Electronics Research Laboratory, Berkeley"},{"key":"47_CR6","first-page":"1108","volume":"20","author":"M. Kozlov","year":"1979","unstructured":"Kozlov M., Tarasov S., Hacijan L. (1979) Polynomial solvability of convex quadratic programming. Soviet Math. Doklady 20, 1108\u20131111","journal-title":"Soviet Math. Doklady"},{"key":"47_CR7","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1023\/A:1008372614175","volume":"15","author":"T. Kuno","year":"1999","unstructured":"Kuno T. (1999) Polynomial algorithms for a class of minimum rank-two cost path problems. J. Global Optim 15, 405\u2013417","journal-title":"J. Global Optim"},{"issue":"4","key":"47_CR8","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N. Megiddo","year":"1979","unstructured":"Megiddo N. (1979) Combinatorial Optimization with rational objective functions. Math OR 4(4): 414\u2013424","journal-title":"Math OR"},{"key":"47_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"P. Pardalos","year":"1991","unstructured":"Pardalos P., Vavasis S. (1991) Quadratic programming with one negative eigenvalue is NP-hard. J. Global Optim. 1, 15\u201322","journal-title":"J. Global Optim."},{"key":"47_CR10","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver A. (1986) Theory of Linear and Integer Programming. Wiley, New york"},{"key":"47_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF01581085","volume":"57","author":"S. Vavasis","year":"1992","unstructured":"Vavasis S. (1992) Approximation algorithms for indefinite quadratic programming. Math. Prog. 57, 279\u2013311","journal-title":"Math. Prog."},{"key":"47_CR12","volume-title":"Nonlinear optimization: complexity issues","author":"S. Vavasis","year":"1991","unstructured":"Vavasis S. (1991) Nonlinear optimization: complexity issues. Oxford University Press, Oxford"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0047-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-006-0047-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0047-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0047-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T20:28:10Z","timestamp":1652819290000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-006-0047-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,21]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["47"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0047-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10,21]]},"assertion":[{"value":"14 April 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2006","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2006","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}