The complexity of computing a robust flow

DOI10.1016/j.orl.2019.10.012OpenAlexW2985811808MaRDI QIDQ2294522

Jannik Matuschke, Yann Disser

Publication date: 11 February 2020

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

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

zbMATH Keywords

network flowsrobust optimizationcomplexity theorynetwork interdiction

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (3)

Probability Distributions on Partially Ordered Sets and Network Interdiction Games ⋮ Decomposition of probability marginals for security games in abstract networks ⋮ Rerouting Flows when Links Fail

Cites Work

• Unnamed Item
• Unnamed Item
• The directed subgraph homeomorphism problem
• Geometric algorithms and combinatorial optimization
• Robust discrete optimization and network flows
• Protection of flows under targeted attacks
• Parametric multiroute flow and its application to multilink-attack network
• Robust flows over time: models and complexity results
• On the power of randomization in network interdiction
• Deterministic network interdiction
• On multiroute maximum flows in networks
• Maximizing residual flow under an arc destruction
• Hardness and approximation for network flow interdiction
• Robust and Adaptive Network Flows
• The maximum residual flow problem: NP‐hardness with two‐arc destruction

This page was built for publication: The complexity of computing a robust flow