The multi-terminal maximum-flow network-interdiction problem
From MaRDI portal
Publication:713097
DOI10.1016/j.ejor.2010.12.011zbMath1250.90021OpenAlexW2156245899MaRDI QIDQ713097
İbrahim Akgün, R. Kevin Wood, Barbaros C. Tansel
Publication date: 26 October 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/21908
Related Items (11)
Stochastic maximum flow interdiction problems under heterogeneous risk preferences ⋮ A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ An exact method for binary fortification games ⋮ Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers ⋮ A bi-level model and memetic algorithm for arc interdiction location-routing problem ⋮ Scalable min-max multi-objective cyber-security optimisation over probabilistic attack graphs ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs ⋮ Perfect matching interdiction problem restricted to a stable vertex ⋮ The continuous maximum capacity path interdiction problem ⋮ Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
Cites Work
- Unnamed Item
- Minimal multicut and maximal integer multiflow: a survey
- Multi-level programming and conflict resolution
- Foundations of bilevel programming
- Deterministic network interdiction
- On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic
- A global optimization algorithm for reliable network design
- Survivable network design under optimal and heuristic interdiction scenarios
- A bilevel mixed-integer program for critical infrastructure protection planning
- On the Stackelberg strategy in nonzero-sum games
- Stochastic Network Interdiction
- Design of Communication Networks with Survivability Constraints
- Maximal Flow Through a Network
- Maximizing the minimum source-sink path subject to a budget constraint
- A problem in network interdiction
- The Complexity of Multiterminal Cuts
- Shortest-path network interdiction
- Two-Person Zero-Sum Games for Network Interdiction
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- A Two-Sided Optimization for Theater Ballistic Missile Defense
- Removing Arcs from a Network
- Optimal interdiction policy for a flow network
- Interception in a network
- Optimal interdiction of a supply network
- Determining the most vital link in a flow network
This page was built for publication: The multi-terminal maximum-flow network-interdiction problem
