Interdiction Games and Monotonicity, with Application to Knapsack Problems

DOI10.1287/ijoc.2018.0831OpenAlexW2940477744WikidataQ127996556 ScholiaQ127996556MaRDI QIDQ5138270

Michele Monaci, Matteo Fischetti, Ivana Ljubić, Markus Sinnl

Publication date: 3 December 2020

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

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

zbMATH Keywords

branch-and-cut bilevel optimization mixed integer optimization interdiction games multidimensional knapsack interdiction prize-collecting interdiction

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Game theory (91Axx)

Related Items

Complexity of the multilevel critical node problem, A generic optimization framework for resilient systems, Play Like the Pros? Solving the Game of Darts as a Dynamic Zero-Sum Game, A Branch-and-Cut Algorithm for Submodular Interdiction Games, Knapsack problems -- an overview of recent advances. I: Single knapsack problems, A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games, A value function-based approach for robust surgery planning, Solution techniques for bi-level knapsack problems, Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem, Optimizing edge sets in networks to produce ground truth communities based on modularity, Exact solution approaches for a class of bilevel fractional programs, A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints, Combining optimisation and simulation using logic-based Benders decomposition, Why there is no need to use a big-\(M\) in linear bilevel optimization: a computational study of two ready-to-use approaches, Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem, A survey on bilevel optimization under uncertainty, Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds, Interdicting restructuring networks with applications in illicit trafficking, A survey on mixed-integer programming techniques in bilevel optimization, On integer and bilevel formulations for the \(k\)-vertex cut problem, An exact approach for the bilevel knapsack problem with interdiction constraints and extensions, An exact method for binary fortification games, Mathematical programming formulations for the collapsed k-core problem, An exact approach for the \(r\)-interdiction covering problem with fortification, Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks, Stackelberg production-protection games: defending crop production against intentional attacks, A study of general and security Stackelberg game formulations, On the Stackelberg knapsack game, The impact of neighboring markets on renewable locations, transmission expansion, and generation investment, A branch-and-cut algorithm for the edge interdiction clique problem, Closing the gap in linear bilevel optimization: a new valid primal-dual inequality, A survey of network interdiction models and algorithms, Outer approximation for global optimization of mixed-integer quadratic bilevel problems, A robust approach for modeling limited observability in bilevel optimization, Multilevel Approaches for the Critical Node Problem, Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method, A framework for generalized Benders' decomposition and its application to multilevel optimization

Uses Software

Cites Work