A faster algorithm for the continuous bilevel knapsack problem.
Dennis FischerGerhard J. WoegingerPublished in: Oper. Res. Lett. (2020)
Keyphrases
- knapsack problem
- implicit enumeration
- dynamic programming
- optimal solution
- np hard
- objective function
- computational complexity
- cost function
- linear programming
- exact algorithms
- optimization algorithm
- learning algorithm
- greedy heuristic
- multidimensional knapsack problem
- combinatorial optimization problems
- test problems
- optimization problems
- simulated annealing
- worst case
- search space
- genetic algorithm
- convex hull
- benchmark problems
- integer programming
- neural network
- constrained optimization
- machine learning