Connectivity interdiction
From MaRDI portal
Publication:1785279
DOI10.1016/j.orl.2014.07.010zbMath1408.90303OpenAlexW2913419847MaRDI QIDQ1785279
Publication date: 28 September 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2014.07.010
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)
Related Items (7)
Interdicting facilities in tree networks ⋮ Maximizing Convergence Time in Network Averaging Dynamics Subject to Edge Removal ⋮ Vertex downgrading to minimize connectivity ⋮ Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives ⋮ Blocking optimal structures ⋮ Unnamed Item ⋮ Multilevel Approaches for the Critical Node Problem
Cites Work
- New approaches to multi-objective optimization
- Matching interdiction
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- On short paths interdiction problems: Total and node-wise limited interdiction
- Network flow interdiction on planar graphs
- Blockers and transversals
- Edge-connectivity augmentation problems
- The most vital edges in the minimum spanning tree problem
- Deterministic network interdiction
- Finding the most vital arcs in a network
- Critical edges for the assignment problem: complexity and exact resolution
- Multicriteria global minimum cuts
- Interdiction Problems on Planar Graphs
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- A problem in network interdiction
- Edge-Connectivity Augmentation with Partition Constraints
- Computing All Small Cuts in an Undirected Network
- A simple min-cut algorithm
- Shortest-path network interdiction
- Packing Interdiction and Partial Covering Problems
- Increasing the Weight of Minimum Spanning Trees
- The network inhibition problem
- Minimum cuts in near-linear time
- Optimal interdiction policy for a flow network
This page was built for publication: Connectivity interdiction
