A dynamic programming approach to solving the multiple choice knapsack problem
From MaRDI portal
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
Cited in
(13)- scientific article; zbMATH DE number 3860891 (Why is no real title available?)
- scientific article; zbMATH DE number 1423920 (Why is no real title available?)
- The multiple-choice multi-period knapsack problem
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems
- Solving the linear multiple choice knapsack problem with two objectives: Profit and equity
- Solution of multiple-choice knapsack problem encountered in high-level synthesis of vlsi circuits
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
- A dynamic programming approach to the multiple-choice multi-period, knapsack problem and the recursive APL2 code
- Large-Scale Scientific Computing
- Multiple criteria dynamic programming and multiple knapsack problem
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- Exact methods for the knapsack problem and its generalizations
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)
