A polynomial algorithm for a continuous bilevel knapsack problem.
Margarida CarvalhoAndrea LodiPatrice MarcottePublished in: Oper. Res. Lett. (2018)
Keyphrases
- knapsack problem
- dynamic programming
- optimal solution
- learning algorithm
- implicit enumeration
- np hard
- linear programming
- greedy heuristic
- objective function
- optimization problems
- test problems
- bicriteria
- lower bound
- metaheuristic
- greedy algorithm
- worst case
- combinatorial optimization problems
- shortest path problem
- cost function
- multidimensional knapsack problem