A bound and bound algorithm for the zero-one multiple knapsack problem
From MaRDI portal
Publication:1155514
DOI10.1016/0166-218X(81)90005-6zbMath0466.90050MaRDI QIDQ1155514
Publication date: 1981
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
integer linear programming; computational results; zero-one multiple knapsack problem; bound and bound algorithm; tree- search technique
65K05: Numerical mathematical programming methods
90C05: Linear programming
90C09: Boolean programming
Related Items
Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver, A branch-and-bound algorithm for hard multiple knapsack problems, An exact penalty function approach for nonlinear integer programming problems, A successive approximation algorithm for the multiple knapsack problem, An exact algorithm for large multiple knapsack problems, Heuristic algorithms for the multiple knapsack problem
Uses Software
Cites Work
- Solution of the zero-one multiple knapsack problem
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
- An Algorithm for the Solution of 0-1 Loading Problems
- An algorithm for 0-1 multiple-knapsack problems