Multilevel Approaches for the Critical Node Problem
From MaRDI portal
Publication:4994170
DOI10.1287/opre.2020.2014zbMath1470.91037OpenAlexW3125629652MaRDI QIDQ4994170
Andrea Lodi, Andrea Tramontani, Margarida Carvalho, Andrea Baggio
Publication date: 17 June 2021
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2020.2014
mixed-integer programmingmultilevel programmingcritical node problemfirefighter problemdefender-attacker-defender
Mixed integer programming (90C11) Applications of game theory (91A80) Multistage and repeated games (91A20)
Related Items
Complexity of the multilevel critical node problem, Interdicting facilities in tree networks, Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets, Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem, A survey on mixed-integer programming techniques in bilevel optimization, An exact method for binary fortification games, A fast tri-individual memetic search approach for the distance-based critical node problem, Outer approximation for global optimization of mixed-integer quadratic bilevel problems
Uses Software
Cites Work
- Unnamed Item
- The most vital nodes with respect to independent set and vertex cover
- Enhanced exact algorithms for discrete bilevel linear problems
- Complexity of the critical node problem over trees
- Matching interdiction
- On short paths interdiction problems: Total and node-wise limited interdiction
- Network flow interdiction on planar graphs
- 0-1 reformulations of the multicommodity capacitated network design problem
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
- Connectivity interdiction
- Deterministic network interdiction
- Finding the most vital arcs in a network
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- One-level reformulation of the bilevel Knapsack problem using dynamic programming
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
- A cutting-plane algorithm for solving a weighted influence interdiction problem
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- 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
- On the Parameterized Complexity of Cutting a Few Vertices from a Graph
- Intersection Cuts for Bilevel Optimization
- Bilevel Knapsack with Interdiction Constraints
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Finding the n Most Vital Links in Flow Networks
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
- Shortest-path network interdiction
- Packing Interdiction and Partial Covering Problems
- Increasing the Weight of Minimum Spanning Trees
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- The Mixed Integer Linear Bilevel Programming Problem
- The network inhibition problem
- Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems
- Algorithms – ESA 2005
- Optimal interdiction policy for a flow network
- A Backward Sampling Framework for Interdiction Problems with Fortification
