The robust bilevel continuous knapsack problem.
Christoph BuchheimDorothee HenkePublished in: CoRR (2019)
Keyphrases
- knapsack problem
- implicit enumeration
- combinatorial optimization problems
- dynamic programming
- optimal solution
- optimization problems
- np hard
- bi objective
- test problems
- multidimensional knapsack problem
- greedy algorithm
- exact algorithms
- np hard problems
- linear programming relaxation
- continuous relaxation
- bicriteria
- greedy heuristic
- linear programming
- robust optimization
- simulated annealing
- lower bound