A dynamic programming algorithm for the bilevel knapsack problem.
Luce BrotcorneSaïd HanafiRaïd MansiPublished in: Oper. Res. Lett. (2009)
Keyphrases
- knapsack problem
- implicit enumeration
- bi objective
- combinatorial optimization problems
- optimal solution
- dynamic programming
- linear programming
- np hard
- greedy algorithm
- test problems
- exact algorithms
- optimization problems
- linear programming relaxation
- bicriteria
- multiple objectives
- greedy heuristic
- maximum profit
- np hard problems
- heuristic solution
- multidimensional knapsack problem
- bilevel programming
- randomly generated test instances
- decision variables
- integer variables
- combinatorial optimization
- continuous relaxation
- upper bound
- lower bound