Protection of flows under targeted attacks

DOI10.1016/j.orl.2016.11.005zbMath1409.90042arXiv1601.03603OpenAlexW2963705725MaRDI QIDQ1727948

Martin Skutella, Gianpaolo Oriolo, Britta Peis, S. Thomas McCormick, Jannik Matuschke

Publication date: 21 February 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.03603

zbMATH Keywords

robust optimizationnetwork designnetwork interdictionnetwork fortification

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (8)

Rerouting Flows when Links Fail ⋮ Maximum Capacity Path Interdiction Problem with Fixed Costs ⋮ Leadership in singleton congestion games: what is hard and what is easy ⋮ The complexity of computing a robust flow ⋮ Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games ⋮ Computing a pessimistic Stackelberg equilibrium with multiple followers: the mixed-pure case ⋮ A decomposition approach for stochastic shortest-path network interdiction with goal threshold ⋮ The continuous maximum capacity path interdiction problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The directed subgraph homeomorphism problem
• Robust discrete optimization and network flows
• On the power of randomization in network interdiction
• Deterministic network interdiction
• Abstract flows over time: a first step towards solving dynamic packing problems
• The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
• Stochastic Network Interdiction
• Integrated Line Planning and Passenger Routing: Connectivity and Transfers
• Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem
• Theory and Applications of Robust Optimization
• A Polynomial Algorithm for Weighted Abstract Flow
• A generalization of max flow—min cut
• Maximizing residual flow under an arc destruction
• Two-Person Zero-Sum Games for Network Interdiction
• Robust and Adaptive Network Flows
• The network inhibition problem
• The maximum residual flow problem: NP‐hardness with two‐arc destruction
• Removing Arcs from a Network

This page was built for publication: Protection of flows under targeted attacks