An exact approach for the bilevel knapsack problem with interdiction constraints and extensions.
Federico Della CroceRosario ScatamacchiaPublished in: Math. Program. (2020)
Keyphrases
- knapsack problem
- implicit enumeration
- decision variables
- combinatorial optimization problems
- optimization problems
- optimal solution
- exact algorithms
- dynamic programming
- bi objective
- binary variables
- np hard
- greedy algorithm
- multidimensional knapsack problem
- integer variables
- bicriteria
- linear programming relaxation
- multiple objectives
- linear relaxation
- linear constraints
- constraint satisfaction
- linear programming
- mathematical program
- lp relaxation
- cutting plane
- constrained optimization
- maximum flow
- heuristic solution
- learning algorithm
- combinatorial problems
- constraint programming
- continuous relaxation
- approximation algorithms