{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T20:22:13Z","timestamp":1767990133961,"version":"3.49.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319455860","type":"print"},{"value":"9783319455877","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-45587-7_15","type":"book-chapter","created":{"date-parts":[[2016,9,9]],"date-time":"2016-09-09T04:01:21Z","timestamp":1473393681000},"page":"166-176","source":"Crossref","is-referenced-by-count":3,"title":["Exact Solution Methods for the k-Item Quadratic Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Lucas","family":"L\u00e9tocart","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelika","family":"Wiegele","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,10]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/978-3-642-38189-8_15","volume-title":"Facets of combinatorial optimization","author":"MF Anjos","year":"2013","unstructured":"Anjos, M.F., Ghaddar, B., Hupp, L., Liers, F., Wiegele, A.: Solving $$k$$ -way graph partitioning problems to optimality: the impact of semidefinite relaxations and the bundle method. In: J\u00fcnger, M., Reinelt, G. (eds.) Facets of combinatorial optimization, pp. 355\u2013386. Springer, Heidelberg (2013)"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E Balas","year":"1980","unstructured":"Balas, E., Zemel, E.: An algorithm for large zero-one knapsack problems. Oper. Res. 28, 1130\u20131154 (1980)","journal-title":"Oper. Res."},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10589-007-9126-9","volume":"43","author":"D Bertsimas","year":"2009","unstructured":"Bertsimas, D., Shioda, R.: Algorithm for cardinality-constrained quadratic optimization. Comput. Optim. Appl. 43, 1\u201322 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Bhaskara, A., Charikar, M., Guruswami, V., Vijayaraghavan, A., Zhou, Y.: Polynomial integrality gaps for strong SDP relaxations of densest $$k$$ -subgraph. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 388\u2013405 (2012)","DOI":"10.1137\/1.9781611973099.34"},{"key":"15_CR5","first-page":"121","volume":"74","author":"D Bienstock","year":"1996","unstructured":"Bienstock, D.: Computational study of a family of mixed-integer quadratic programming problems. Math. Programm. 74, 121\u2013140 (1996)","journal-title":"Math. Programm."},{"issue":"3","key":"15_CR6","first-page":"171","volume":"43","author":"A Billionnet","year":"2005","unstructured":"Billionnet, A.: Different formulations for solving the heaviest k-subgraph problem. Inf. Syst. Oper. Res. 43(3), 171\u2013186 (2005)","journal-title":"Inf. Syst. Oper. Res."},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/0377-2217(94)00229-0","volume":"92","author":"A Billionnet","year":"1996","unstructured":"Billionnet, A., Calmels, F.: Linear programming for the 0\u20131 quadratic knapsack problem. Eur. J. Oper. Res. 92, 310\u2013325 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20132","key":"15_CR8","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10107-010-0381-7","volume":"131","author":"A Billionnet","year":"2012","unstructured":"Billionnet, A., Elloumi, S., Lambert, A.: Extending the QCR method to general mixed-integer programs. Math. Programm. 131(1\u20132), 381\u2013401 (2012)","journal-title":"Math. Programm."},{"key":"15_CR9","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1287\/opre.1080.0599","volume":"57","author":"P Bonami","year":"2009","unstructured":"Bonami, P., Lejeune, M.: An exact solution approach for portfolio optimization problems under stochastic and integer constraints. Oper. Res. 57, 650\u2013670 (2009)","journal-title":"Oper. Res."},{"issue":"1","key":"15_CR10","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11","author":"B Borchers","year":"1999","unstructured":"Borchers, B.: CSDP, a C library for semidefinite programming. Optim. Meth. Softw. 11(1), 613\u2013623 (1999)","journal-title":"Optim. Meth. Softw."},{"key":"15_CR11","unstructured":"IBM ILOG CPLEX Callable Library version 12.6.2. http:\/\/www-03.ibm.com\/software\/products\/en\/ibmilogcpleoptistud\/"},{"issue":"2\u20133","key":"15_CR12","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10107-005-0661-9","volume":"105","author":"I Fischer","year":"2006","unstructured":"Fischer, I., Gruber, G., Rendl, F., Sotirov, R.: Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut, equipartition. Math. Programm. Ser. B 105(2\u20133), 451\u2013469 (2006)","journal-title":"Math. Programm. Ser. B"},{"key":"15_CR13","unstructured":"Helmberg, C.: The conicbundle library for convex optimization, August 2015. https:\/\/www-user.tu-chemnitz.de\/~helmberg\/ConicBundle\/Manual\/index.html"},{"issue":"2","key":"15_CR14","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C Helmberg","year":"1996","unstructured":"Helmberg, C., Rendl, F., Vanderbei, R.J., Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM J. Optim. 6(2), 342\u2013361 (1996)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"15_CR15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10107-012-0594-z","volume":"143","author":"N Krislock","year":"2014","unstructured":"Krislock, N., Malick, J., Roupin, F.: Improved semidefinite bounding procedure for solving max-cut problems to optimality. Math. Program. Ser. A 143(1\u20132), 61\u201386 (2014)","journal-title":"Math. Program. Ser. A"},{"issue":"1","key":"15_CR16","doi-asserted-by":"crossref","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"},{"key":"15_CR17","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1057\/palgrave.jam.2250079","volume":"8","author":"G Mitra","year":"2007","unstructured":"Mitra, G., Ellison, F., Scowcroft, A.: Quadratic programming for portfolio planning: insights into algorithmic and computational issues. J. Asset Manage. 8, 249\u2013258 (2007). Part ii: Processing of Portfolio Planning Models with Discrete Constraints","journal-title":"J. Asset Manage."},{"key":"15_CR18","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: a survey. Discrete Appl. Math. 155, 623\u2013648 (2007)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"15_CR19","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0167-6377(02)00122-0","volume":"30","author":"DJ Rader Jr","year":"2002","unstructured":"Rader Jr., D.J., Woeginger, G.J.: The quadratic 0\u20131 knapsack problem with series-parallel support. Oper. Res. Lett. 30(3), 159\u2013166 (2002)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"15_CR20","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","volume":"121","author":"F Rendl","year":"2010","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving max-cut to optimality by intersecting semidefinite, polyhedral relaxations. Math. Program. Ser. A 121(2), 307\u2013335 (2010)","journal-title":"Math. Program. Ser. A"},{"issue":"2\u20133","key":"15_CR21","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/s10107-006-0038-8","volume":"109","author":"F Rendl","year":"2007","unstructured":"Rendl, F., Sotirov, R.: Bounds for the quadratic assignment problem using the bundle method. Math. Program. Ser. B 109(2\u20133), 505\u2013524 (2007)","journal-title":"Math. Program. Ser. B"},{"key":"15_CR22","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1080\/10556780701722542","volume":"23","author":"DX Shawa","year":"2008","unstructured":"Shawa, D.X., Liub, S., Kopmanb, L.: Lagrangean relaxation procedure for cardinality-constrained portfolio optimization. Optim. Meth. Softw. 23, 411\u2013420 (2008)","journal-title":"Optim. Meth. Softw."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45587-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T22:18:19Z","timestamp":1498342699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45587-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319455860","9783319455877"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45587-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}