The maximum residual flow problem: NP‐hardness with two‐arc destruction

DOI10.1002/net.20188zbMath1146.90345OpenAlexW4243384718MaRDI QIDQ5434585

R. Chandrasekaran, Dong-lei Du

Publication date: 7 January 2008

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20188

zbMATH Keywords

arc destructioncapacity representativeresidual flow NP-hard

Mathematics Subject Classification ID

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

Related Items

The value of information in stochastic maximum flow problems, Robust flows with adaptive mitigation, Protection of flows under targeted attacks, The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability, Robust flows over time: models and complexity results, On the power of randomization in network interdiction, The complexity of computing a robust flow

Cites Work

• Geometric algorithms and combinatorial optimization