Solution of the zero-one multiple knapsack problem
From MaRDI portal
Publication:1142701
DOI10.1016/0377-2217(80)90112-5zbMath0439.90059MaRDI QIDQ1142701
Publication date: 1980
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(80)90112-5
combinatorial optimization; bounding procedures; solution algorithm; computational performance; branch and bound scheme; different branching strategies; zero-one multiple knapsack problem
65K05: Numerical mathematical programming methods
68Q60: Specification and verification (program logics, model checking, etc.)
90C09: Boolean programming
Related Items
Semi-definite relaxation algorithm of multiple knapsack problem, An exact algorithm for large multiple knapsack problems, Bounds for nested knapsack problems, Heuristic algorithms for the multiple knapsack problem, Heuristics and their design: A survey, A bound and bound algorithm for the zero-one multiple knapsack problem
Cites Work
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- Dynamic Loading and Unloading of Liquids into Tanks
- An Algorithm for the Solution of 0-1 Loading Problems
- Merging and Sorting Applied to the Zero-One Knapsack Problem
- Computing Partitions with Applications to the Knapsack Problem
- An algorithm for 0-1 multiple-knapsack problems
