{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:18:47Z","timestamp":1780633127642,"version":"3.54.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1023\/a:1022584312032","type":"journal-article","created":{"date-parts":[[2003,3,28]],"date-time":"2003-03-28T23:03:18Z","timestamp":1048892598000},"page":"99-111","source":"Crossref","is-referenced-by-count":27,"title":["A 3\/4-Approximation Algorithm for Multiple Subset Sum"],"prefix":"10.1007","volume":"9","author":[{"given":"Alberto","family":"Caprara","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hans","family":"Kellerer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5114915_CR1","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1137\/S1052623498348481","volume":"11","author":"A. Caprara","year":"2000","unstructured":"Caprara, A., H. Kellerer, and U. Pferschy. (2000). \u201cThe Multiple Subset Sum Problem.\u201d SIAM Journal on Opti-mization 11, 308\u2013319.","journal-title":"SIAM Journal on Opti-mization"},{"key":"5114915_CR2","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., H. Kellerer, and U. Pferschy. (2000). \u201cA PTAS for the Multiple Subset Sum Problem with Different Knapsack Capacities.\u201d Information Processing Letters 73, 111\u2013118.","journal-title":"Information Processing Letters"},{"key":"5114915_CR3","unstructured":"Caprara, A., H. Kellerer, and U. Pferschy. (2000). \u201cA 3\/4-Approximation Algorithm for Multiple Subset Sum.\u201d Research Report OR\/00\/7 DEIS. Available at http:\/\/www.or.deis.unibo.it\/techrep.html."},{"key":"5114915_CR4","unstructured":"Chekuri, C. and S. Khanna. (2000). \u201cA PTAS for the Multiple Knapsack Problem.\u201d In Proceedings of SODA 00, pp. 213\u2013222."},{"key":"5114915_CR5","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1009894503716","volume":"4","author":"M. Dawande","year":"2000","unstructured":"Dawande, M., J. Kalagnanam, P. Keskinocak, F.S. Salman, and R. Ravi. (2000). \u201cApproximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions.\u201d Journal of Combinatorial Optimization 4, 171\u2013186.","journal-title":"Journal of Combinatorial Optimization"},{"key":"5114915_CR6","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1009856820553","volume":"3","author":"M. Dell'Amico","year":"1999","unstructured":"Dell'Amico, M. and S. Martello. (1999). \u201cReduction of the Three-Partition Problem.\u201d Journal of Combinatorial Optimization 3, 17\u201330.","journal-title":"Journal of Combinatorial Optimization"},{"key":"5114915_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman."},{"key":"5114915_CR8","first-page":"51","volume-title":"Proceedings of APPROX 99","author":"H. Kellerer","year":"1999","unstructured":"Kellerer, H. (1999). \u201cA Polynomial Approximation Scheme for the Multiple Knapsack Problem.\u201d In Proceedings of APPROX 99, Lecture Notes in Computer Science, Vol. 1671, pp. 51\u201362, Berlins: Springer."},{"key":"5114915_CR9","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S. and P. Toth. (1990). Knapsack Problems: Algorithms and Computer Implementations. Chichester: J. Wiley & Sons."},{"key":"5114915_CR10","unstructured":"Wirsching, G. Personal communication."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022584312032.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1022584312032\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022584312032.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T10:50:54Z","timestamp":1747651854000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1022584312032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["5114915"],"URL":"https:\/\/doi.org\/10.1023\/a:1022584312032","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}