{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:36:58Z","timestamp":1760708218184},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T00:00:00Z","timestamp":1280188800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s10878-010-9337-3","type":"journal-article","created":{"date-parts":[[2010,7,26]],"date-time":"2010-07-26T21:23:33Z","timestamp":1280179413000},"page":"21-28","source":"Crossref","is-referenced-by-count":1,"title":["Improving an exact approach for solving separable integer quadratic knapsack problems"],"prefix":"10.1007","volume":"23","author":[{"given":"Federico","family":"Della Croce","sequence":"first","affiliation":[]},{"given":"Dominique","family":"Quadri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,7,27]]},"reference":[{"issue":"3","key":"9337_CR1","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/S0377-2217(01)00179-5","volume":"138","author":"K Bretthauer","year":"2002","unstructured":"Bretthauer K, Shetty B (2002) The nonlinear knapsack problem\u2014algorithms and applications. Eur J Oper Res 138(3):459\u2013472","journal-title":"Eur J Oper Res"},{"key":"9337_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"PC Chu","year":"1998","unstructured":"Chu PC, Beasley JE (1998) A genetic algorithm for the multidimensional knapsack problem. J Heuristics 4:63\u201386","journal-title":"J Heuristics"},{"issue":"5","key":"9337_CR3","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 (1988) A Surrogate-based algorithm for the general quadratic multidimensional knapsack. Oper Res Lett 7(5):253\u2013257","journal-title":"Oper Res Lett"},{"issue":"10","key":"9337_CR4","doi-asserted-by":"crossref","first-page":"1376","DOI":"10.1287\/mnsc.20.10.1376","volume":"20","author":"B Faaland","year":"1974","unstructured":"Faaland B (1974) An integer programming algorithm for portfolio selection. Manag Sci 20(10):1376\u20131384","journal-title":"Manag Sci"},{"issue":"4","key":"9337_CR5","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F Glover","year":"1975","unstructured":"Glover F (1975) Improved linear integer programming formulations of nonlinear integer problems. Manag Sci 22(4):455\u2013460","journal-title":"Manag Sci"},{"issue":"2","key":"9337_CR6","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1016\/0377-2217(85)90181-X","volume":"19","author":"F Korner","year":"1985","unstructured":"Korner F (1985) Integer quadratic programming. Eur J Oper Res 19(2):268\u2013273","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9337_CR7","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/0377-2217(90)90017-6","volume":"46","author":"F Korner","year":"1990","unstructured":"Korner F (1990) On the numerical realization of the exact penalty method for quadratic programming algorithms. Eur J Oper Res 46(3):404\u2013408","journal-title":"Eur J Oper Res"},{"key":"9337_CR8","volume-title":"Nonlinear integer programming","author":"D Li","year":"2006","unstructured":"Li D, Sun XL (2006) Nonlinear integer programming. Springer, Berlin"},{"issue":"1","key":"9337_CR9","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10898-006-9128-7","volume":"39","author":"D Li","year":"2007","unstructured":"Li D, Wang J, Sun XL (2007) Computing exact solution to nonlinear integer programming: Convergent Lagrangian and objective level cut method. J Glob Optim 39(1):127\u2013154","journal-title":"J Glob Optim"},{"issue":"4","key":"9337_CR10","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0167-6377(83)90047-0","volume":"2","author":"K Mathur","year":"1983","unstructured":"Mathur K, Salkin H (1983) A branch and bound algorithm for a class of nonlinear knapsack problems. Oper Res Lett 2(4):155\u2013160","journal-title":"Oper Res Lett"},{"key":"9337_CR11","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 (2009) Exact solution methods to solve large scale integer quadratic knapsack problems. J Comb Optim 17:157\u2013167","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9337-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9337-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9337-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:14Z","timestamp":1559276594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9337-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,27]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["9337"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9337-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,27]]}}}