An Enumeration Algorithm for Knapsack Problems
A. Victor Cabot · Operations Research · 1970
Enumeration techniques have been shown to be successful for solving integer linear programming problems. The purpose of this paper is to apply the enumeration philosophy to the classical knapsack problem; it shows that this approach applies quite naturally to this type of integer linear program when combined with the Fourier-Motzkin elimination method for solving linear inequalities. Some computational results are reported.
Cited by 63 works. doi:10.1287/opre.18.2.306
Authors
References
- Dynamic Programming
- Linear Programming and Extensions
- A Linear Programming Approach to the Cutting-Stock Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Integer Programming: Methods, Uses, Computations
- Multistage Cutting Stock Problems of Two and More Dimensions
- The Theory and Computation of Knapsack Functions
- Beiträge zur Theorie der linearen Ungleichungen
- A Finite Renewal Algorithm for the Knapsack and Turnpike Models
- PROJECTIONS OF CONVEX POLYHEDRAL SETS