Pages that link to "Item:Q761349"
From MaRDI portal
The following pages link to A dynamic programming approach to solving the multiple choice knapsack problem (Q761349):
Displaying 11 items.
- Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
- Multiple criteria dynamic programming and multiple knapsack problem (Q529961) (← links)
- Solving the linear multiple choice knapsack problem with two objectives: Profit and equity (Q839491) (← links)
- Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem (Q1894383) (← links)
- Development of a hybrid dynamic programming approach for solving discrete nonlinear Knapsack problems (Q2371518) (← links)
- (Q3329226) (← links)
- The multiple-choice multi-period knapsack problem (Q4661132) (← links)
- (Q4945108) (← links)
- Large-Scale Scientific Computing (Q5426118) (← links)