Maximizing residual flow under an arc destruction

@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}
}
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

Citations

Publications citing this paper.
Showing 1-10 of 18 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Ratio combinatorial programs

  • Y. P. Aneja, S. N. Kabadi
  • Eur J Oper Res 81
  • 1995
1 Excerpt

Network Flows

  • R. K. Ahuja, T. L. Magnanti, J. B. Orlin
  • Prentice Hall, NJ
  • 1993
1 Excerpt

Bicriteria transportation prob

  • K. P. K. Nair
  • 1979

Bicriteria transportation problem

  • Y. P. Aneja, K.P.K. Nair
  • Mgmt Sci 25
  • 1979
1 Excerpt

Determining the most vital link in a flow network

  • S. H. Lubore, H. D. Ratliff, G. T. Sicilia
  • Naval Res Log Q 18
  • 1971
2 Excerpts

Similar Papers

Loading similar papers…