A dynamic programming approach to solving the multiple choice knapsack problem
From MaRDI portal
Publication:761349
zbMath0555.90075MaRDI QIDQ761349
Publication date: 1984
Published in: Bulletin of the Polish Academy of Sciences. Technical Sciences (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Dynamic programming (90C39) Boolean programming (90C09)
Related Items (2)
Exact methods for the knapsack problem and its generalizations ⋮ A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
This page was built for publication: A dynamic programming approach to solving the multiple choice knapsack problem
