Skip to main content
Log in

Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem

  • Published:
Mathematical Programming Submit manuscript

Abstract.

We analyze the asymptotic behavior of the Flow Deviation Method, first presented in 1971 by Fratta, Gerla and Kleinrock, and show that when applied to packing linear programs such as the maximum concurrent flow problem, it yields a fully polynomial-time approximation scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: December 28, 2000 / Accepted: May 25, 2001¶Published online October 2, 2001

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bienstock, D., Raskina, O. Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem. Math. Program. 91, 479–492 (2002). https://doi.org/10.1007/s101070100254

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s101070100254

Navigation