## Robust flows over time: models and complexity results

- Corinna Gottschalk, Arie M. C. A. Koster, Frauke Liers, Britta Peis, Daniel Schmand, Andreas Wierz
- Math. Program.
- 2018

Highly Influenced

@article{Aneja2001MaximizingRF, title={Maximizing residual flow under an arc destruction}, author={Yash P. Aneja and Ramaswamy Chandrasekaran and Kunhiraman Nair}, journal={Networks}, year={2001}, volume={38}, pages={194-198} }

- Published 2001 in Networks
DOI:10.1002/net.10001

In this paper, we consider two problems related to single-commodity flows on a directed network. In the first problem, for a given s−t flow, if an arc is destroyed, all the flow that is passing through that arc is destroyed. What is left flowing from s to t is the residual flow. The objective is to determine a flow pattern such that the residual flow is maximized. We provide a strongly polynomial algorithm for this problem, called the maximum residual flow problem, and consider various… CONTINUE READING

18 Citations

11 References

Similar Papers