{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T07:21:03Z","timestamp":1771485663910,"version":"3.50.1"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"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 Combinatorial Optimization"],"published-print":{"date-parts":[[1999,7]]},"DOI":"10.1023\/a:1009813105532","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T23:53:29Z","timestamp":1040601209000},"page":"59-71","source":"Crossref","is-referenced-by-count":77,"title":["A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem"],"prefix":"10.1007","volume":"3","author":[{"given":"Hans","family":"Kellerer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"211418_CR1","unstructured":"A. Caprara, H. Kellerer, U. Pferschy, and D. Pisinger, \"Approximation algorithms for knapsack problems with cardinality constraints,\" Technical Report 01\/1998, Faculty of Economics, University Graz, to appear in European Journal of Operational Research."},{"key":"211418_CR2","first-page":"394","volume":"1350","author":"H. Kellerer","year":"1997","unstructured":"H. Kellerer, R. Mansini, U. Pferschy, and M.G. Speranza, \"An efficient fully polynomial approximation scheme for the subset-sum problem,\" Technical Report 14\/1997, Faculty of Economics, University Graz, submitted. See also Proceedings of the 8th ISAAC Symposium, Springer Lecture Notes in Computer Science vol. 1350, pp. 394\u2013403, 1997.","journal-title":"Proceedings of the 8th ISAAC Symposium"},{"key":"211418_CR3","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"E. Lawler","year":"1979","unstructured":"E. Lawler, \"Fast approximation algorithms for knapsack problems,\" Mathematics of Operations Research, vol. 4, pp. 339\u2013356, 1979.","journal-title":"Mathematics of Operations Research"},{"key":"211418_CR4","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(81)90175-2","volume":"8","author":"M.J. Magazine","year":"1981","unstructured":"M.J. Magazine and O. Oguz, \"A fully polynomial approximation algorithm for the 0\u20131 knapsack problem,\" European Journal of Operational Research, vol. 8, pp. 270\u2013273, 1981.","journal-title":"European Journal of Operational Research"},{"key":"211418_CR5","unstructured":"S. Martello and P. Toth, Knapsack Problems, John Wiley & Sons, 1990."},{"key":"211418_CR6","first-page":"1","volume-title":"Handbook of Combinatorial Optimization","author":"D. Pisinger","year":"1998","unstructured":"D. Pisinger and P. Toth, \"Knapsack problems,\" in Handbook of Combinatorial Optimization, D.Z. Du and P. Pardalos (Eds.), Kluwer: Norwell, pp. 1\u201389, 1998."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009813105532.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009813105532\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009813105532.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:17:13Z","timestamp":1751282233000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009813105532"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["211418"],"URL":"https:\/\/doi.org\/10.1023\/a:1009813105532","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}