{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:40:16Z","timestamp":1743140416365,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":11,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_536","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:09:00Z","timestamp":1219662540000},"page":"3153-3159","source":"Crossref","is-referenced-by-count":13,"title":["Quadratic Integer Programming: Complexity and Equivalent Forms"],"prefix":"10.1007","author":[{"given":"W. Art","family":"Chaovalitwongse","sequence":"first","affiliation":[]},{"given":"Ioannis P.","family":"Androulakis","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"536_CR1_536","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.orl.2004.03.005","volume":"32","author":"WA Chaovalitwongse","year":"2004","unstructured":"Chaovalitwongse WA, Pardalos PM, Prokoyev OA (2004) Reduction of multi-quadratic 0\u20131\n\t    programming problems to linear mixed 0\u20131 programming problems. Oper Res Lett 32(6):517\u2013522","journal-title":"Oper Res Lett"},{"key":"536_CR2_536","unstructured":"Giannessi F, Niccolucci F (1976) Connections between nonlinear and integer\n\tprogramming problems. Istituto Nazionale di Alta Matematica, Symposia Mathematica 19:161\u2013176"},{"issue":"3","key":"536_CR3_536","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/BF00940067","volume":"68","author":"WW Hager","year":"1991","unstructured":"Hager WW, Pardalos PM, Roussos IM, Sahinoglou HD (1991) Active constraints, indefinite quadratic programming, and test\n\t    problems. J\u00a0Optim Theor Appl 68(3):499\u2013511","journal-title":"J Optim Theor Appl"},{"key":"536_CR4_536","volume-title":"Introduction to global optimization","author":"R Horst","year":"1995","unstructured":"Horst R, Pardalos PM, Thoai NV (1995) Introduction to global\n\t    optimization. Kluwer, Dordrecht"},{"key":"536_CR5_536","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0898-1221(91)90163-X","volume":"21","author":"PM Pardalos","year":"1991","unstructured":"Pardalos PM (1991) Global optimization algorithms for linearly constrained indefinite quadratic problems. Comput Math\n\t    Appl 21:87\u201397","journal-title":"Comput Math Appl"},{"key":"536_CR6_536","unstructured":"Pardalos PM, Rodgers G (1989) Parallel branch and bound algorithms for\n\tunconstrained quadratic zero-one programming. In: Sharda R et al (eds) Impact of recent computer advances on operations research. Elsevier,\n\tpp\u00a0131\u2013143"},{"key":"536_CR7_536","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"PM Pardalos","year":"1990","unstructured":"Pardalos PM, Rodgers G (1990) Computational aspects of a\u00a0branch and bound algorithm for quadratic zero-one\n\t    programming. Comput 45:131\u2013144","journal-title":"Comput"},{"issue":"1","key":"536_CR8_536","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0167-6377(88)90049-1","volume":"7","author":"PM Pardalos","year":"1988","unstructured":"Pardalos PM, Schnitger G (1988) Checking local optimality in constrained quadratic programming is $$ \\mathcal{NP} $$-hard. Oper Res Lett\n\t    7(1):33\u201335","journal-title":"Oper Res Lett"},{"key":"536_CR9_536","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"PM Pardalos","year":"1991","unstructured":"Pardalos PM, Vavasis S (1991) Quadratic\n\t    programming with one negative eigenvalue is $$ \\mathcal{NP}\n\t\t$$-hard. J\u00a0Global Optim 1:15\u201323","journal-title":"J Global Optim"},{"key":"536_CR10_536","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1137\/0203021","volume":"3","author":"S Sahni","year":"1974","unstructured":"Sahni S (1974) Computationally related\n\t    problems. SIAM J Comput 3:262\u2013279","journal-title":"SIAM J Comput"},{"key":"536_CR11_536","volume-title":"Nonlinear optimization: complexity issues","author":"S Vavasis","year":"1991","unstructured":"Vavasis S (1991) Nonlinear optimization: complexity issues. Oxford\n\t    Univeristy Press, Oxford"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_536","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T09:53:10Z","timestamp":1720691590000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_536"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_536","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}