Pages that link to "Item:Q428109"
From MaRDI portal
The following pages link to Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (Q428109):
Displayed 9 items.
- Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
- An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics (Q670759) (← links)
- Solving 0-1 knapsack problems based on amoeboid organism algorithm (Q2016352) (← links)
- Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem (Q2079394) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem (Q2282074) (← links)
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
- New upper bounds and exact methods for the knapsack sharing problem (Q2396494) (← links)
- Cognitive discrete gravitational search algorithm for solving 0-1 knapsack problem (Q2987849) (← links)