An exact method for binary fortification games

DOI10.1016/j.ejor.2022.10.038arXiv2111.13400MaRDI QIDQ6167322

Kübra Tanınmış, Markus Leitner, Michele Monaci, Markus Sinnl, Ivana Ljubić

Publication date: 10 July 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.13400

zbMATH Keywords

combinatorial optimizationbranch-and-cutthree-level optimizationmaximum knapsack fortificationshortest path fortification

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Optimizing dynamic investment decisions for railway systems protection
• A class of algorithms for mixed-integer bilevel min-max optimization
• Bilevel programming and the separation problem
• A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
• The multi-terminal maximum-flow network-interdiction problem
• A comparison of solution strategies for biobjective shortest path problems
• The maximum clique interdiction problem
• An analytical approach to the protection planning of a rail intermodal terminal network
• On the use of intersection cuts for bilevel optimization
• Exact interdiction models and algorithms for disconnecting networks via node deletions
• A branch-and-cut algorithm for the edge interdiction clique problem
• Tri-level mixed-binary linear programming: solution approaches and application in defending critical infrastructure
• Complexity of the multilevel critical node problem
• On integer and bilevel formulations for the \(k\)-vertex cut problem
• An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
• A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
• Improved \(x\)-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks
• An exact algorithm for solving the bilevel facility interdiction and fortification problem
• A survey of network interdiction models and algorithms
• Survivable network design under optimal and heuristic interdiction scenarios
• A bilevel mixed-integer program for critical infrastructure protection planning
• An exact solution approach for the interdiction median problem with fortification
• Integer programming methods for solving binary interdiction games
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Bilevel Knapsack with Interdiction Constraints
• A Study on the Computational Complexity of the Bilevel Knapsack Problem
• A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
• Shortest-path network interdiction
• Multilevel Approaches for the Critical Node Problem
• A Branch-and-Cut Algorithm for Submodular Interdiction Games
• A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
• Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
• Interdiction Games and Monotonicity, with Application to Knapsack Problems
• A Backward Sampling Framework for Interdiction Problems with Fortification
• A survey on mixed-integer programming techniques in bilevel optimization

This page was built for publication: An exact method for binary fortification games