{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:15:02Z","timestamp":1759666502385},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,11,17]],"date-time":"2007-11-17T00:00:00Z","timestamp":1195257600000},"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":[[2009,5]]},"DOI":"10.1007\/s10878-007-9116-y","type":"journal-article","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T15:52:35Z","timestamp":1195228355000},"page":"347-366","source":"Crossref","is-referenced-by-count":7,"title":["A successive approximation algorithm for the multiple knapsack problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Zhenbo","family":"Wang","sequence":"first","affiliation":[]},{"given":"Wenxun","family":"Xing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,11,17]]},"reference":[{"key":"9116_CR1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0167-6377(03)00092-0","volume":"32","author":"A Caprara","year":"2004","unstructured":"Caprara A, Pferschy U (2004) Worst-case analysis of the subset sum algorithm for bin packing. Oper Res Lett 32:159\u2013166","journal-title":"Oper Res Lett"},{"key":"9116_CR2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1137\/S1052623498348481","volume":"6","author":"A Caprara","year":"2000","unstructured":"Caprara A, Kellerer H, Pferschy U (2000a) The multiple subset sum problem. SIAM J Optim 6:308\u2013319","journal-title":"SIAM J Optim"},{"key":"9116_CR3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0020-0190(00)00010-7","volume":"73","author":"A Caprara","year":"2000","unstructured":"Caprara A, Kellerer H, Pferschy U (2000b) A\u00a0PTAS for the multiple subset sum problem with different knapsack capacities. Inf Process Lett 73:111\u2013118","journal-title":"Inf Process Lett"},{"key":"9116_CR4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1023\/A:1022584312032","volume":"9","author":"A Caprara","year":"2003","unstructured":"Caprara A, Kellerer H, Pferschy U (2003) A 3\/4-approximation algorithm for multiple subset sum. J\u00a0Heuristics 9:99\u2013111","journal-title":"J\u00a0Heuristics"},{"key":"9116_CR5","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/S0097539700382820","volume":"35","author":"C Chekuri","year":"2005","unstructured":"Chekuri C, Khanna S (2005) A\u00a0polynomial time approximation scheme for the multiple knapsack problem. SIAM J Comput 35:713\u2013728","journal-title":"SIAM J Comput"},{"key":"9116_CR6","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"9116_CR7","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321812.321823","volume":"21","author":"E Horowitz","year":"1974","unstructured":"Horowitz E, Sahni S (1974) Computing partitions with applications to the knapsack problem. J\u00a0ACM 21:277\u2013292","journal-title":"J\u00a0ACM"},{"key":"9116_CR8","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"OH Ibarra","year":"1975","unstructured":"Ibarra OH, Kim CE (1975) Fast approximation algorithms for the knapsack and sum of subset problem. J\u00a0ACM 22:463\u2013468","journal-title":"J\u00a0ACM"},{"key":"9116_CR9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1009813105532","volume":"3","author":"H Kellerer","year":"1999","unstructured":"Kellerer H, Pferschy U (1999) A\u00a0new fully polynomial time approximation scheme for the knapsack problem. J\u00a0Comb Optim 3:59\u201371","journal-title":"J\u00a0Comb Optim"},{"key":"9116_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin"},{"key":"9116_CR11","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"EL Lawler","year":"1979","unstructured":"Lawler EL (1979) Fast approximation algorithms for knapsack problems. Math Oper Res 4:339\u2013356","journal-title":"Math Oper Res"},{"key":"9116_CR12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0377-2217(77)90024-8","volume":"1","author":"S Martello","year":"1977","unstructured":"Martello S, Toth P (1977) An upper bound for the zero-one knapsack problem and a branch and bound algorithm. Eur J Oper Res 1:169\u2013175","journal-title":"Eur J Oper Res"},{"key":"9116_CR13","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0166-218X(81)90005-6","volume":"3","author":"S Martello","year":"1981","unstructured":"Martello S, Toth P (1981) A\u00a0branch and bound algorithm for the zero-one multiple knapsack problem. Discrete Appl Math 3:275\u2013288","journal-title":"Discrete Appl Math"},{"key":"9116_CR14","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0377-2217(99)00260-X","volume":"123","author":"S Martello","year":"2000","unstructured":"Martello S, Pisinger D, Toth P (2000) New trends in exact algorithms for the 0-1 knapsack problem. Eur J Oper Res 123:325\u2013332","journal-title":"Eur J Oper Res"},{"key":"9116_CR15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1287\/mnsc.23.1.27","volume":"23","author":"RM Nauss","year":"1976","unstructured":"Nauss RM (1976) An efficient algorithm for the 0-1 knapsack problem. Manag Sci 23:27\u201331","journal-title":"Manag Sci"},{"key":"9116_CR16","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/S0377-2217(98)00120-9","volume":"114","author":"D Pisinger","year":"1999","unstructured":"Pisinger D (1999) An exact algorithm for the large multiple knapsack problems. Eur J Oper Res 114:528\u2013541","journal-title":"Eur J Oper Res"},{"key":"9116_CR17","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/978-1-4613-0303-9_5","volume-title":"Handbook of combinatorial optimization, vol\u00a01","author":"D Pisinger","year":"1998","unstructured":"Pisinger D, Toth P (1998) Knapsack problems. In: Handbook of combinatorial optimization, vol\u00a01. Kluwer Academic, Dordrecht, pp 299\u2013428"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9116-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9116-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9116-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:12Z","timestamp":1559276292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9116-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,17]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["9116"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9116-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,17]]}}}