{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:59:55Z","timestamp":1742975995443,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319180076"},{"type":"electronic","value":"9783319180083"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18008-3_16","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T07:32:51Z","timestamp":1429083171000},"page":"231-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Wen-Yang","family":"Ku","sequence":"first","affiliation":[]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1590\/S0101-74382014000100005","volume":"34","author":"L L\u00e9tocart","year":"2014","unstructured":"L\u00e9tocart, L., Plateau, M.C., Plateau, G.: An efficient hybrid heuristic method for the 0\u20131 exact k-item quadratic knapsack problem. Pesquisa Operacional 34(1), 49\u201372 (2014)","journal-title":"Pesquisa Operacional"},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ejor.2008.12.023","volume":"200","author":"R Mart\u00ed","year":"2010","unstructured":"Mart\u00ed, R., Gallego, M., Duarte, A.: A branch and bound algorithm for the maximum diversity problem. European Journal of Operational Research 200(1), 36\u201344 (2010)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1287\/ijoc.11.2.125","volume":"11","author":"A Caprara","year":"1999","unstructured":"Caprara, A., Pisinger, D., Toth, P.: Exact solution of the quadratic knapsack problem. INFORMS Journal on Computing 11(2), 125\u2013137 (1999)","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0377-2217(99)00261-1","volume":"123","author":"A Caprara","year":"2000","unstructured":"Caprara, A., Kellerer, H., Pferschy, U., Pisinger, D.: Approximation algorithms for knapsack problems with cardinality constraints. European Journal of Operational Research 123(2), 333\u2013345 (2000)","journal-title":"European Journal of Operational Research"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1016\/j.renene.2013.10.023","volume":"63","author":"S Turner","year":"2014","unstructured":"Turner, S., Romero, D., Zhang, P., Amon, C., Chan, T.: A new mathematical programming approach to optimize wind farm layouts. Renewable Energy 63, 674\u2013680 (2014)","journal-title":"Renewable Energy"},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s13675-014-0024-5","volume":"2","author":"PY Zhang","year":"2014","unstructured":"Zhang, P.Y., Romero, D.A., Beck, J.C., Amon, C.H.: Solving wind farm layout optimization with mixed integer programs and constraint programs. EURO Journal on Computational Optimization 2(3), 195\u2013219 (2014)","journal-title":"EURO Journal on Computational Optimization"},{"issue":"2","key":"16_CR7","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.orl.2004.04.014","volume":"33","author":"M Lewis","year":"2005","unstructured":"Lewis, M., Alidaee, B., Kochenberger, G.: Using xqx to model and solve the uncapacitated task allocation problem. Operations Research Letters 33(2), 176\u2013182 (2005)","journal-title":"Operations Research Letters"},{"key":"16_CR8","series-title":"Wiley Encyclopedia of Operations Research and Management Science","volume-title":"MINLP solver software","author":"MR Bussieck","year":"2010","unstructured":"Bussieck, M.R., Vigerske, S.: MINLP solver software. Wiley Encyclopedia of Operations Research and Management Science. Wiley, Chichester (2010)"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10107-005-0637-9","volume":"109","author":"A Billionnet","year":"2007","unstructured":"Billionnet, A., Elloumi, S.: Using a mixed integer quadratic programming solver for the unconstrained quadratic 0\u20131 problem. Mathematical Programming 109(1), 55\u201368 (2007)","journal-title":"Mathematical Programming"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Krislock, N., Malick, J., Roupin, F.: Improved semidefinite bounding procedure for solving max-cut problems to optimality. Mathematical Programming, 1\u201326 (2012)","DOI":"10.1007\/s10107-012-0594-z"},{"key":"16_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-72011-6","volume-title":"GPS for Geodesy","author":"PJ Teunissen","year":"1998","unstructured":"Teunissen, P.J., Kleusberg, A., Teunissen, P.: GPS for Geodesy, vol. 2. Springer, Berlin (1998)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-319-07046-9_24","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"W-Y Ku","year":"2014","unstructured":"Ku, W.-Y., Beck, J.C.: Combining discrete ellipsoid-based search and branch-and-cut for binary quadratic programming problems. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 334\u2013350. Springer, Heidelberg (2014)"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/TWC.2008.060497","volume":"7","author":"XW Chang","year":"2008","unstructured":"Chang, X.W., Han, Q.: Solving box-constrained integer least squares problems. IEEE Transactions on Wireless Communications 7(1), 277\u2013287 (2008)","journal-title":"IEEE Transactions on Wireless Communications"},{"issue":"3","key":"16_CR14","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1137\/060660680","volume":"31","author":"XW Chang","year":"2009","unstructured":"Chang, X.W., Golub, G.H.: Solving ellipsoid-constrained integer least squares problems. SIAM Journal on Matrix Analysis and Applications 31(3), 1071\u20131089 (2009)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Ku, W.Y., Beck, J.C.: Combining discrete ellipsoid-based search and branch-and-cut for integer least squares problems. Submitted to IEEE Transactions on Wireless Communications (2014)","DOI":"10.1007\/978-3-319-07046-9_24"},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"CP Schnorr","year":"1994","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: Improved practical algorithms and solving subset sum problems. Mathematical programming 66(1), 181\u2013199 (1994)","journal-title":"Mathematical programming"},{"key":"16_CR17","unstructured":"Krislock, N., Malick, J., Roupin, F.: BiqCrunch online solver (2012) (Retrieved: 11\/06\/2014). http:\/\/lipn.univ-paris13.fr\/BiqCrunch\/download"},{"key":"16_CR18","unstructured":"Achterberg, T.: Constraint Integer Programming. PhD thesis, Technische Universit\u00e4t Berlin (2007)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18008-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,31]],"date-time":"2020-12-31T08:03:43Z","timestamp":1609401823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-18008-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319180076","9783319180083"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18008-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}