Analysis of budget for interdiction on multicommodity network flows
From MaRDI portal
(Redirected from Publication:513161)
Recommendations
Cites work
- scientific article; zbMATH DE number 2050720 (Why is no real title available?)
- A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems
- A Survey of Linear Cost Multicommodity Network Flows
- A problem in network interdiction
- Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
- Deterministic network interdiction
- Dual-ascent methods for large-scale multicommodity flow problems
- Exact algorithms for solving a Euclidean maximum flow network interdiction problem
- Matching interdiction
- Maximizing the minimum source-sink path subject to a budget constraint
- Multi-Commodity Disconnecting Sets
- Multi-Commodity Network Flows
- Multicommodity disconnecting set problem
- Network flows. Theory, algorithms, and applications.
- Optimal interdiction of a supply network
- Optimal interdiction policy for a flow network
- Removing Arcs from a Network
- Shortest-path network interdiction
- Solving the bi-objective maximum-flow network-interdiction problem
- Stochastic network interdiction
- Survivable network design under optimal and heuristic interdiction scenarios
- The Complexity of Multiterminal Cuts
- The network inhibition problem
- Two-Person Zero-Sum Games for Network Interdiction
- Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming
Cited in
(1)
This page was built for publication: Analysis of budget for interdiction on multicommodity network flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513161)