Multilevel approaches for the critical node problem
From MaRDI portal
Recommendations
Cites work
- 0-1 reformulations of the multicommodity capacitated network design problem
- A Backward Sampling Framework for Interdiction Problems with Fortification
- A bilevel mixed-integer program for critical infrastructure protection planning
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- A cutting-plane algorithm for solving a weighted influence interdiction problem
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- Algorithms – ESA 2005
- An exact solution approach for the interdiction median problem with fortification
- Approximation algorithms for the geometric firefighter and budget fence problems
- Bilevel knapsack with interdiction constraints
- Complexity of the critical node problem over trees
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Connectivity interdiction
- Deterministic network interdiction
- Enhanced exact algorithms for discrete bilevel linear problems
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Finding the n Most Vital Links in Flow Networks
- Finding the most vital arcs in a network
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Increasing the Weight of Minimum Spanning Trees
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Intersection cuts for bilevel optimization
- Matching interdiction
- Network flow interdiction on planar graphs
- New Branch-and-Bound Rules for Linear Bilevel Programming
- On short paths interdiction problems: Total and node-wise limited interdiction
- On the Parameterized Complexity of Cutting a Few Vertices from a Graph
- One-level reformulation of the bilevel Knapsack problem using dynamic programming
- Optimal interdiction policy for a flow network
- Packing interdiction and partial covering problems
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- Shortest-path network interdiction
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
- Survivable network design under optimal and heuristic interdiction scenarios
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- The Firefighter problem: a survey of results, directions and questions
- The Mixed Integer Linear Bilevel Programming Problem
- The most vital nodes with respect to independent set and vertex cover
- The network inhibition problem
Cited in
(15)- Outer approximation for global optimization of mixed-integer quadratic bilevel problems
- 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 bi-level programming model for protecting an important node in a network
- 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
- Min–max optimization of node‐targeted attacks in service networks
- Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption
- The critical node game
- Learning primal heuristics for 0-1 knapsack interdiction problems
- Robust facility location considering protection and backup under facility disruptions with decision-dependent uncertainty
- On supervalid inequalities for binary interdiction games
This page was built for publication: Multilevel approaches for the critical node problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4994170)
