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

Mathematical Programming, Series B

Volumn 91, Issue 3, 2002, Pages 479-492

  Bienstock, Daniel ^a   Raskina, Olga ^a  

^a Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC ANALYSIS; CONCURRENT FLOW PROBLEM; FLOW DEVIATION METHOD;

LINEAR PROGRAMMING; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

COMPUTATIONAL METHODS;

EID: 4544219528     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070100254     Document Type: Article

References (27)

1. Bienstock, D. (2000): Approximately solving large-scale linear programs. I. Strengthening lower bounds and accelerating convergence, CORC Report 1999-1, Columbia University.
2. (Extended abstract: Proc 11th. Ann. ACM-SIAM Symposium on Discrete Algorithms, January 2000)
3. Bienstock, D. (2001 ): Potential function methods for approximately solving linear programs: theory and practice. To appear, CORE Lecture Series, CORE (U.C.L., Louvain-la-Neuve, Belgium) September 2001
4. Courant, R. (1943): Variational methods for the solution of problems of equilibrium and vibration. Bull. Amer. Math. Soc. 49, 1-43
5. Dafermos, S.C., Sparrow, F.T. (1969): The traffic assignment problem for a general network. Journal of Research of the National Bureau of Standards - B 73B
6. Danzig, G.B., Wolfe, P. ( 1961): The decomposition algorithm for linear programming, Econometrica 29, 767-778
7. Fleischer, L. (2000): Approximating fractional multicommodity flow independent of the number of commodities. SIAM J. Disc. Math. 3, 505-520
8. Fiacco, A.V., McCormick, G.P. (1968): Nonlinear Programming: Sequential Unconstrained Optimization Techniques. Wiley, New York
9. Frank, M., Wolfe, P. (1956): An algorithm for quadratic programming. Naval Res. Logistics Quarterly 3, 149-154
10. Fratta, L., Gerla, M., Kleinrock, L. (1971): The flow deviation method: an approach to store-and-forward communication network design. Networks 3, 97-133
11. Goldberg, A.V., Oldham, J.D., Plotkin, S., Stein, C. (1998): An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity How. Proc. IPCO, pp. 338-352
12. Grigoriadis, M.D., Khachiyan, L.G. (1994): Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM Journal on Optimization 4, 86-107
13. Grigoriadis, M.D., Khachiyan, L.G. (1995): An exponential-function reduction method for block-angular convex programs. Networks 26, 59-68
14. Grigoriadis, M.D., Khachiyan, L.G. (1996): Coordination complexity of parallel price-directive decomposition. Math. Oper. Res. 21, 321-340
15. Garg, N., Könemann, J. (1998): Faster and simpler algorithms for mullicommodity flow and other fractional packing problems. Proc. 39th Ann. Symp. on Foundations of Comp. Sci. pp. 300-309
16. Karger, D., Plotkin, S. (1995): Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows. Proc. 27th Ann. ACM Symp. on Theory of Computing, pp. 18-25
17. Klein, P., Plotkin, S., Stein, C., Tardos, E. (1990): Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. Proc. 22nd Ann. ACM Symp. on Theory of Computing, pp. 310-321
18. Klein, P., Young, N. (1999): On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms. Proc. IPCO, pp. 320-327
19. Leighton, T., Makedon, F., Plotkin, S., Stein, C., Tardos, E., Tragoudas, S. (1991): Fast approximation algorithms for multicommodity flow problems. Proc. 23nd Ann. ACM Symp. on Theory of Computing, pp. 101-111
20. Leighton, T., Rao, S. (1988): An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, Proc. FOCS 29, pp. 422-431
21. Plotkin, S., Shmoys, D.B., Tardos, E. (1991): Fast approximation algorithms for fractional packing and covering problems. Math. of Oper. Res. 20 (1995) 495-504.
22. Extended abstract: Proc. 32nd Annual IEEE Symp. On Foundations of Computer Science, pp. 495-504
23. Radzik, T. (1995): Fast deterministic approximation for the multicommodity flow problem. Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, pp. 486-492
24. Raskina, O. (2001): Ph.D. Dissertation, Dept. of IEOR, Columbia University
25. Shahrokhi, F., Matula, D.W. (1991): The maximum concurrent flow problem. Journal ACM 37, 318-334
26. Villavicencio, J., Grigoriadis, M.D. (1995): Approximate Lagrangian decomposition using a modified Karmarkar logarithmic potential, in: Network Optimization (Pardalos, Hager, eds.) Lecture Notes in Economics and Mathematical Systems 450. Springer, Berlin, pp. 471-485
27. Young, N. (1995): Randomized rounding without solving the linear program, in: The maximum concurrent flow problem. Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, pp. 170-178