Lower Bounds and a New Exact Approach for the Bilevel Knapsack with Interdiction Constraints.
Federico Della CroceRosario ScatamacchiaPublished in: IPCO (2019)
Keyphrases
- lower bound
- upper bound
- lower and upper bounds
- exact solution
- objective function
- knapsack problem
- optimal solution
- branch and bound algorithm
- branch and bound
- constraint satisfaction
- linear programming
- max min
- dynamic programming
- maximum flow
- online learning
- global constraints
- np hard
- special case
- upper and lower bounds
- quadratic assignment problem
- optimal cost