Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints
From MaRDI portal
Publication:2293085
DOI10.1007/978-3-030-17953-3_12zbMATH Open1436.90119OpenAlexW2943117283MaRDI QIDQ2293085FDOQ2293085
Authors: Rosario Scatamacchia, F. Della Croce 
Publication date: 6 February 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-17953-3_12
Recommendations
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- Bilevel knapsack with interdiction constraints
- A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem
- Exact solution approach for a class of nonlinear bilevel knapsack problems
- Improved approximation algorithms for a bilevel knapsack problem
- Improved approximation algorithms for a bilevel knapsack problem
- A complexity and approximability study of the bilevel knapsack problem
- An exact algorithm for bilevel 0-1 knapsack problems
- Bilevel programming with knapsack constraints
Cited In (6)
- On the Stackelberg knapsack game
- An enhanced branch-and-bound algorithm for bilevel integer linear programming
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- A Stackelberg knapsack game with weight control
- The trouble with the second quantifier
- A survey on mixed-integer programming techniques in bilevel optimization
This page was built for publication: Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2293085)
