{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:30Z","timestamp":1750308750775,"version":"3.41.0"},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T00:00:00Z","timestamp":1196467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCSE Bull."],"published-print":{"date-parts":[[2007,12]]},"abstract":"<jats:p>The 0\/1 knapsack (or knapsack without repetition) has a dynamic programming solution driven by a table in which each item is consecutively considered. The problem can also be approached by generating a table in which the optimal knapsack for each knapsack capacity is generated, modeled on the solution to the integer knapsack (knapsack with repetition) found in Sedgewick [1] and the solution to change-making found in Ciubatii [2].<\/jats:p>","DOI":"10.1145\/1345375.1345414","type":"journal-article","created":{"date-parts":[[2008,2,28]],"date-time":"2008-02-28T14:02:33Z","timestamp":1204207353000},"page":"54-56","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["An alternative dynamic programming solution for the 0\/1 knapsack"],"prefix":"10.1145","volume":"39","author":[{"given":"Timothy J.","family":"Rolfe","sequence":"first","affiliation":[{"name":"Eastern Washington University, Cheney, Washington"}]}],"member":"320","published-online":{"date-parts":[[2007,12]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Robert Sedgewick Algorithms in C (3rd edition; Addison-Wesley 1998) p. 215 as Program 5.13. Also in the same author's Algorithms in Java (3rd edition; Addison-Wesley 2003) p. 225 as Program 5.13.  Robert Sedgewick Algorithms in C (3rd edition; Addison-Wesley 1998) p. 215 as Program 5.13. Also in the same author's Algorithms in Java (3rd edition; Addison-Wesley 2003) p. 225 as Program 5.13."},{"key":"e_1_2_1_2_1","unstructured":"Dumitru Ciubatii \"Dynamic Programming: From novice to advanced\" URL as of 2007 February 22: http:\/\/www.topcoder.com\/tc?module=Static&d1=tutorials&d2=dynProg.  Dumitru Ciubatii \"Dynamic Programming: From novice to advanced\" URL as of 2007 February 22: http:\/\/www.topcoder.com\/tc?module=Static&d1=tutorials&d2=dynProg."},{"key":"e_1_2_1_3_1","unstructured":"Thomas H. Corman Charles E. Leiserson Ronald L. Rivest and Clifford Stein Introduction to Algorithms (2nd edition; MIT Press 2002) pp 382 384ex.   Thomas H. Corman Charles E. Leiserson Ronald L. Rivest and Clifford Stein Introduction to Algorithms (2nd edition; MIT Press 2002) pp 382 384ex."},{"key":"e_1_2_1_4_1","first-page":"266","author":"Brassard Giles","year":"1996","journal-title":"Prentice-Hall Inc."},{"key":"e_1_2_1_5_1","first-page":"299","author":"Levitin Anany","year":"2007","journal-title":"Pearson Education Inc."}],"container-title":["ACM SIGCSE Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1345375.1345414","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1345375.1345414","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:20Z","timestamp":1750278140000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1345375.1345414"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["10.1145\/1345375.1345414"],"URL":"https:\/\/doi.org\/10.1145\/1345375.1345414","relation":{},"ISSN":["0097-8418"],"issn-type":[{"type":"print","value":"0097-8418"}],"subject":[],"published":{"date-parts":[[2007,12]]},"assertion":[{"value":"2007-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}