Maximizing residual flow under an arc destruction
From MaRDI portal
Publication:4537607
DOI10.1002/net.10001zbMath0993.90014MaRDI QIDQ4537607
K. P. K. Nair, R. Chandrasekaran, Yash P. Aneja
Publication date: 1 July 2002
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.10001
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
Related Items
Polynomial-time identification of robust network flows under uncertain arc failures, Parametric min-cuts analysis in a network., Parametric analysis of overall min-cuts and applications in undirected networks., Flows over edge-disjoint mixed multipaths and applications
Cites Work
- Unnamed Item
- Ratio combinatorial programs
- \(\varepsilon\)-approximation minimization of convex functions in fixed dimension
- Bicriteria Transportation Problem
- On the structure of all minimum cuts in a network and applications
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Determining the most vital link in a flow network