{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:19:29Z","timestamp":1725902369935},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319619101"},{"type":"electronic","value":"9783319619118"}],"license":[{"start":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T00:00:00Z","timestamp":1498608000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-61911-8_2","type":"book-chapter","created":{"date-parts":[[2017,6,27]],"date-time":"2017-06-27T03:52:40Z","timestamp":1498535560000},"page":"13-22","source":"Crossref","is-referenced-by-count":1,"title":["Reformulation of the Quadratic Multidimensional Knapsack Problem as Copositive\/Completely Positive Prorams"],"prefix":"10.1007","author":[{"given":"D. V.","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,28]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","DOI":"10.1142\/5273","volume-title":"Completely Positive Matrices","author":"A Berman","year":"2003","unstructured":"Berman, A., Shaked-Monderer, N.: Completely Positive Matrices. World Scientific, Singapore (2003)"},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/ijoc.1030.0029","volume":"16","author":"A Billionnet","year":"2004","unstructured":"Billionnet, A., Soutif, E.: Using a mixed integer programming tool for solving the 0\u20131 quadratic knapsack problem. INFORMS J. Comput. 16, 188\u2013197 (2004)","journal-title":"INFORMS J. Comput."},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1016\/S0377-2217(03)00244-3","volume":"157","author":"A Billionnet","year":"2004","unstructured":"Billionnet, A., Soutif, E.: An exact method based on Lagrangian decomposition for the 0\u20131 quadratic knapsack problem. Eur. J. Oper. Res. 157, 565\u2013575 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1026583532263","volume":"18","author":"IM Bomze","year":"2000","unstructured":"Bomze, I.M., D\u00fcr, M., de Klerk, E., Roos, C., Quist, A.J., Terlaky, T.: On copositive programming and standard quadratic optimization problems. J. Global Optim. 18, 301\u2013320 (2000)","journal-title":"J. Global Optim."},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/070711815","volume":"20","author":"S Bundfuss","year":"2009","unstructured":"Bundfuss, S., D\u00fcr, M.: An adaptive linear approximation algorithm for copositive programs. SIAM J. Optim. 20, 30\u201353 (2009)","journal-title":"SIAM J. Optim."},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120, 479\u2013495 (2009)","journal-title":"Math. Program."},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0167-6377(88)90041-7","volume":"7","author":"M Djerdjour","year":"1988","unstructured":"Djerdjour, M., Mathur, K., Salkin, H.: A surrogate-based algorithm for the general quadratic multidimensional knapsack. Oper. Res. Lett. 7, 253\u2013257 (1988)","journal-title":"Oper. Res. Lett."},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-642-12598-0_1","volume-title":"Recent Advances in Optimization and its Applications in Engineering","author":"M D\u00fcr","year":"2010","unstructured":"D\u00fcr, M.: Copositive programming a survey. In: Diehl, M., Glineur, F., Jarlebring, E., Michiels, W. (eds.) Recent Advances in Optimization and its Applications in Engineering, pp. 3\u201320. Springer, Heidelberg (2010)"},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"1376","DOI":"10.1287\/mnsc.20.10.1376","volume":"20","author":"B Faaland","year":"1974","unstructured":"Faaland, B.: An integer programming algorithm for portfolio selection. Manag. Sci. 20, 1376\u20131384 (1974)","journal-title":"Manag. Sci."},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1137\/090750391","volume":"52","author":"J-B Hiriart-Urruty","year":"2010","unstructured":"Hiriart-Urruty, J.-B., Seeger, A.: A variational approach to copositive matrices. SIAM Rev. 52, 593\u2013629 (2010)","journal-title":"SIAM Rev."},{"issue":"1","key":"2_CR11","first-page":"77","volume":"7","author":"HM Markowitz","year":"1952","unstructured":"Markowitz, H.M.: Portfolio selection. J. Finan. 7(1), 77\u201391 (1952)","journal-title":"J. Finan."},{"key":"2_CR12","unstructured":"Nguyen, D.V.: Contributions to quadratic optimization: algorithms, copositive programming reformulations and duality. Ph.D. thesis, Department of Mathematics, University of Trier (2017)"},{"key":"2_CR13","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0024-3795(91)90267-Z","volume":"152","author":"PM Pardalos","year":"1991","unstructured":"Pardalos, P.M., Ye, Y., Han, C.G.: Algorithms for the solution of quadratic knapsack problems. Linear Algebra Appl. 152, 69\u201391 (1991)","journal-title":"Linear Algebra Appl."},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.dam.2006.08.007","volume":"155","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D.: The quadratic knapsack problem\u2014a survey. Discret. Appl. Math. 155, 623\u2013648 (2007)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"2_CR15","first-page":"146","volume":"4","author":"D Quadri","year":"2007","unstructured":"Quadri, D., Soutif, E., Tolla, P.: Upper bounds for large scale integer quadratic multidimensional knapsack. Int. J. Oper. Res. 4(3), 146\u2013154 (2007)","journal-title":"Int. J. Oper. Res."},{"issue":"2","key":"2_CR16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s10878-007-9105-1","volume":"17","author":"D Quadri","year":"2009","unstructured":"Quadri, D., Soutif, E., Tolla, P.: Exact solution method to solve large scale integer quadratic multidimensional knapsack problems. J. Comb. Optim. 17(2), 157\u2013167 (2009)","journal-title":"J. Comb. Optim."}],"container-title":["Advances in Intelligent Systems and Computing","Advanced Computational Methods for Knowledge Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61911-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,27]],"date-time":"2017-06-27T03:53:10Z","timestamp":1498535590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-61911-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,28]]},"ISBN":["9783319619101","9783319619118"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61911-8_2","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017,6,28]]}}}