| Article ID: | iaor2003722 |
| Country: | Germany |
| Volume: | 91 |
| Issue: | 3 |
| Start Page Number: | 479 |
| End Page Number: | 492 |
| Publication Date: | Jan 2002 |
| Journal: | Mathematical Programming |
| Authors: | Bienstock D., Raskina O. |
| Keywords: | programming: linear |
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.