Exact methods for discrete ${\varGamma }$-robust interdiction problems with an application to the bilevel knapsack problem.
Yasmine BeckIvana LjubicMartin SchmidtPublished in: Math. Program. Comput. (2023)
Keyphrases
- knapsack problem
- exact algorithms
- optimization problems
- combinatorial optimization problems
- exact methods
- decision variables
- optimal solution
- implicit enumeration
- np hard
- multidimensional knapsack problem
- continuous relaxation
- approximate solutions
- exact solution
- special case
- branch and bound algorithm
- lower bound
- approximation algorithms
- learning algorithm
- machine learning
- combinatorial problems
- greedy algorithm
- robust optimization
- np complete
- integer variables