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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: December 28, 2000 / Accepted: May 25, 2001¶Published online October 2, 2001
Rights and permissions
About this article
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
Published:
Issue Date:
DOI: https://doi.org/10.1007/s101070100254