An alternative dynamic programming solution for the 0/1 knapsack

Authors:
Timothy J. Rolfe
Affiliations:
Eastern Washington University, Cheney, Washington
Venue:
ACM SIGCSE Bulletin
Year:
2007

Citing 3
Cited 0

Fundamentals of algorithmics

Fundamentals of algorithmics
Introduction to Algorithms and Java CD-ROM

Introduction to Algorithms and Java CD-ROM
Introduction to the Design and Analysis of Algorithms (2nd Edition)

Introduction to the Design and Analysis of Algorithms (2nd Edition)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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].