One-level reformulation of the bilevel Knapsack problem using dynamic programming.
Luce BrotcorneSaïd HanafiRaïd MansiPublished in: Discret. Optim. (2013)
Keyphrases
- knapsack problem
- dynamic programming
- implicit enumeration
- linear programming
- combinatorial optimization problems
- exact algorithms
- greedy algorithm
- bi objective
- optimal solution
- test problems
- lower level
- optimization problems
- linear programming relaxation
- np hard problems
- continuous relaxation
- heuristic solution
- multidimensional knapsack problem
- bicriteria
- multiple objectives
- np hard
- infinite horizon
- lagrangian relaxation
- special case
- linear program
- greedy heuristic
- machine learning
- maximum profit