{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:55:02Z","timestamp":1725573302157},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343752"},{"type":"electronic","value":"9783540343783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758471_7","type":"book-chapter","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T06:34:15Z","timestamp":1149230055000},"page":"42-49","source":"Crossref","is-referenced-by-count":0,"title":["Quadratic Programming and Combinatorial Minimum Weight Product Problems"],"prefix":"10.1007","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","reference":[{"key":"7_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"7_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.: Generalized Convexity. Plenum Press, New York (1988)"},{"key":"7_CR3","volume-title":"Algorithmic Principles of Mathematical Programming","author":"U. Faigle","year":"2001","unstructured":"Faigle, U., Kern, W., Still, G.: Algorithmic Principles of Mathematical Programming. Kluwer, Dordrecht (2001)"},{"key":"7_CR4","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"7_CR5","unstructured":"Gusfield, D.: Sensitivity analysis for combinatorial optimization, Memorandum UCB\/ERL M80\/22, Electronics Research Laboratory, Berkeley (1980)"},{"key":"7_CR6","first-page":"1108","volume":"20","author":"M. Kozlov","year":"1979","unstructured":"Kozlov, M., Tarasov, S., Hacijan, L.: Polynomial Solvability of Convex Quadratic Programming. Soviet Math.\u00a0Doklady\u00a020, 1108\u20131111 (1979)","journal-title":"Soviet Math.\u00a0Doklady"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1023\/A:1008372614175","volume":"15","author":"T. Kuno","year":"1999","unstructured":"Kuno, T.: Polynomial algorithms for a class of minimum rank-two cost path problems. Journal of Global Optimization\u00a015, 405\u2013417 (1999)","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"7_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.: Combinatorial Optimization with rational objective functions. Mathematics of OR\u00a04(4), 414\u2013424 (1979)","journal-title":"Mathematics of OR"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"P. Pardalos","year":"1991","unstructured":"Pardalos, P., Vavasis, S.: Quadratic Programming with One Negative Eigenvalue is NP-hard. Journal of Global Optimization\u00a01, 15\u201322 (1991)","journal-title":"Journal of Global Optimization"},{"key":"7_CR10","volume-title":"Theory of linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of linear and Integer Programming. Wiley, Chichester (1986)"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF01581085","volume":"57","author":"S. Vavasis","year":"1992","unstructured":"Vavasis, S.: Approximation algorithms for indefinite quadratic programming. Math. Prog.\u00a057, 279\u2013311 (1992)","journal-title":"Math. Prog."},{"key":"7_CR12","volume-title":"Nonlinear optimization: complexity issues","author":"S. Vavasis","year":"1991","unstructured":"Vavasis, S.: Nonlinear optimization: complexity issues. Oxford University Press, Oxford (1991)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758471_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:04:31Z","timestamp":1619492671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758471_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343752","9783540343783"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11758471_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}