A dynamic programming approach to solving the multiple choice knapsack problem
From MaRDI portal
Publication:761349
zbMATH Open0555.90075MaRDI QIDQ761349FDOQ761349
Authors: Krzysztof Dudzinski 
Publication date: 1984
Published in: Bulletin of the Polish Academy of Sciences. Technical Sciences (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 3889280
- A minimal algorithm for the multiple-choice knapsack problem
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
- The linear multiple choice knapsack problem
- A fast algorithm for the linear multiple-choice knapsack problem
Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Boolean programming (90C09)
Cited In (13)
- The multiple-choice multi-period knapsack problem
- Title not available (Why is that?)
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- Title not available (Why is that?)
- Solution of multiple-choice knapsack problem encountered in high-level synthesis of vlsi circuits
- Solving the linear multiple choice knapsack problem with two objectives: Profit and equity
- A dynamic programming approach to the multiple-choice multi-period, knapsack problem and the recursive APL2 code
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
- Exact methods for the knapsack problem and its generalizations
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems
- Large-Scale Scientific Computing
- Multiple criteria dynamic programming and multiple knapsack problem
This page was built for publication: A dynamic programming approach to solving the multiple choice knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761349)
