Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints

DOI10.1007/978-3-030-17953-3_12zbMath1436.90119OpenAlexW2943117283MaRDI QIDQ2293085

Rosario Scatamacchia, Frederico Della Croce

Publication date: 6 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17953-3_12

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Positional games (pursuit and evasion, etc.) (91A24)

Related Items

A survey on mixed-integer programming techniques in bilevel optimization ⋮ An exact approach for the bilevel knapsack problem with interdiction constraints and extensions ⋮ On the Stackelberg knapsack game ⋮ An enhanced branch-and-bound algorithm for bilevel integer linear programming ⋮ The trouble with the second quantifier ⋮ A Stackelberg knapsack game with weight control