Analysis of budget for interdiction on multicommodity network flows

DOI10.1007/S10898-016-0422-8zbMATH Open1365.90253OpenAlexW2298127995MaRDI QIDQ513161FDOQ513161

Authors: Yong-Cai Geng, Sumit K. Garg 

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

Recommendations

• Network flow interdiction on planar graphs
• An approximation algorithm for network flow interdiction with unit costs and two capacities
• The multi-terminal maximum-flow network-interdiction problem
• Hardness and approximation for network flow interdiction
• Deterministic network interdiction

zbMATH Keywords

multicommodity flowinterdictionnetwork vulnerabilitycritical budget

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Network flows. Theory, algorithms, and applications.
• A Survey of Linear Cost Multicommodity Network Flows
• The Complexity of Multiterminal Cuts
• Analysis of facility protection strategies against an uncertain number of attacks: the stochastic R-interdiction median problem with fortification
• Deterministic network interdiction
• Removing Arcs from a Network
• Stochastic network interdiction
• Two-Person Zero-Sum Games for Network Interdiction
• Multi-Commodity Network Flows
• Shortest-path network interdiction
• Optimal interdiction policy for a flow network
• Matching interdiction
• Solving the bi-objective maximum-flow network-interdiction problem
• Maximizing the minimum source-sink path subject to a budget constraint
• Title not available (Why is that?)
• Survivable network design under optimal and heuristic interdiction scenarios
• A problem in network interdiction
• Optimal interdiction of a supply network
• The network inhibition problem
• A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems
• Exact algorithms for solving a Euclidean maximum flow network interdiction problem
• Dual-ascent methods for large-scale multicommodity flow problems
• Multicommodity disconnecting set problem
• Multi-Commodity Disconnecting Sets
• Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming

Cited In (1)

• An approach to the analysis of possible structural damages in multicommodity network systems

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)