Analysis of budget for interdiction on multicommodity network flows
From MaRDI portal
Publication:513161
DOI10.1007/s10898-016-0422-8zbMath1365.90253OpenAlexW2298127995MaRDI QIDQ513161
Publication date: 3 March 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10150/623040
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matching interdiction
- Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
- Deterministic network interdiction
- Survivable network design under optimal and heuristic interdiction scenarios
- Stochastic Network Interdiction
- Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
- Maximizing the minimum source-sink path subject to a budget constraint
- A Survey of Linear Cost Multicommodity Network Flows
- A problem in network interdiction
- A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems
- The Complexity of Multiterminal Cuts
- Exact algorithms for solving a Euclidean maximum flow network interdiction problem
- Dual-ascent methods for large-scale multicommodity flow problems
- Shortest-path network interdiction
- Two-Person Zero-Sum Games for Network Interdiction
- The network inhibition problem
- Multi-Commodity Disconnecting Sets
- Removing Arcs from a Network
- Optimal interdiction policy for a flow network
- Optimal interdiction of a supply network
- Multi-Commodity Network Flows
- Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming
This page was built for publication: Analysis of budget for interdiction on multicommodity network flows
