Bilevel Knapsack with Interdiction Constraints

DOI10.1287/ijoc.2015.0676zbMath1343.90075OpenAlexW2319807324MaRDI QIDQ3186662

Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger, Alberto Caprara

Publication date: 12 August 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2015.0676

zbMATH Keywords

knapsack problem bilevel programming min-max problem

Mathematics Subject Classification ID

Integer programming (90C10) Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27)

Related Items

A Branch-and-Cut Algorithm for Submodular Interdiction Games, Knapsack problems -- an overview of recent advances. I: Single knapsack problems, A faster algorithm for the continuous bilevel knapsack problem, A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games, A polynomial algorithm for a continuous bilevel knapsack problem, Solution techniques for bi-level knapsack problems, Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem, Logic-based Benders decomposition for wildfire suppression, A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints, A survey on bilevel optimization under uncertainty, Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds, A survey on mixed-integer programming techniques in bilevel optimization, An exact approach for the bilevel knapsack problem with interdiction constraints and extensions, An exact method for binary fortification games, On the complexity of robust multi-stage problems with discrete recourse, On Bilevel Optimization with Inexact Follower, A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation, Interdiction Games and Monotonicity, with Application to Knapsack Problems, Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization, Solving Quadratic Programming by Cutting Planes, The maximum clique interdiction problem, A dynamic reformulation heuristic for generalized interdiction problems, On the Stackelberg knapsack game, An enhanced branch-and-bound algorithm for bilevel integer linear programming, Algorithms and applications for a class of bilevel MILPs, Leadership in singleton congestion games: what is hard and what is easy, Closing the gap in linear bilevel optimization: a new valid primal-dual inequality, The subset sum game revisited, A survey of network interdiction models and algorithms, The trouble with the second quantifier, Outer approximation for global optimization of mixed-integer quadratic bilevel problems, The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem, Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games, Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case, Multilevel Approaches for the Critical Node Problem, Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method, A Stackelberg knapsack game with weight control, A framework for generalized Benders' decomposition and its application to multilevel optimization, Methods for Pessimistic Bilevel Optimization, A Unified Framework for Multistage Mixed Integer Linear Optimization, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Uses Software

Cites Work