Operations Research · 1975 · 32 citations · 5 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsOptimizationAssignment ProblemsBranch And BoundCombinatorial OptimizationInteger Programming0-1 Knapsack ProblemBin Packing ProblemCombinatorial SearchEnumerative AlgorithmsKnapsack ProblemsOrder Relation
An enumerative algorithm is presented for the solution of 0-1 many-knapsack or loading problems. It is based on the principle that before a search is attempted as many decisions as possible should be made about inclusion or exclusion of objects from the knapsacks. This is accomplished by the introduction of a new ordering relation among the objects. This ordering relation, coupled with other relations we define, allows a drastic reduction in the extent of the search required to determine a solution.
5
A Branch and Bound Algorithm for the Knapsack Problem
Peter Kolesar · Management Science · 1967 · 209 citations
Samuel Eilon, Nicos Christofides · Management Science · 1971 · 166 citations
Natural Sciences, Industrial Engineering, Operations Management +7
An Enumeration Algorithm for Knapsack Problems
A. Victor Cabot · Operations Research · 1970 · 63 citations