Network interdiction via a critical disruption path: branch-and-price algorithms
DOI10.1016/J.COR.2013.04.016zbMATH Open1348.90596OpenAlexW1982943536MaRDI QIDQ336604FDOQ336604
Steffen Rebennack, Donatella Granata, Gregory Steeger
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.04.016
Recommendations
- Network interdiction through length-bounded critical disruption paths: a bi-objective approach
- Shortest-path network interdiction
- Optimal \(K\)-node disruption on a node-capacitated network
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Optimal detection of critical nodes: improvements to model structure and performance
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Mixed integer programming (90C11)
Cites Work
- Maximal Flow Through a Network
- Title not available (Why is that?)
- Identifying sets of key players in a social network
- Selected Topics in Column Generation
- Finding the most vital arcs in a network
- Detecting critical nodes in sparse graphs
- Deterministic network interdiction
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Removing Arcs from a Network
- Interior point stabilization for column generation
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
- Shortest-path network interdiction
- A cutting plane algorithm for computing \(k\)-edge survivability of a network
- Solving the bi-objective maximum-flow network-interdiction problem
- Optimal interdiction of a supply network
Cited In (13)
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
- Optimal detection of critical nodes: improvements to model structure and performance
- The stochastic critical node problem over trees
- Finding the most degree-central walks and paths in a graph: exact and heuristic approaches
- A hybrid modified-NSGA-II VNS algorithm for the multi-objective critical disruption path problem
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
- Network interdiction through length-bounded critical disruption paths: a bi-objective approach
- A bi-level model and memetic algorithm for arc interdiction location-routing problem
- Detecting critical node structures on graphs: A mathematical programming approach
- The connected critical node problem
- Sequential Shortest Path Interdiction with Incomplete Information
- A study of network violator interception based on a reliable game model
Uses Software
This page was built for publication: Network interdiction via a critical disruption path: branch-and-price algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336604)
