A scaling algorithm for multicommodity flow problems

Operations Research

Volumn 46, Issue 2, 1998, Pages 231-246

  Schneur, Rina R ^a   Orlin, James B ^b  

^a PTCG Inc   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COST EFFECTIVENESS; ITERATIVE METHODS; OPTIMAL CONTROL SYSTEMS; OPTIMIZATION; PARAMETER ESTIMATION; PROBLEM SOLVING;

COMPLEMENTARY SLACKNESS CONDITIONS; MULTICOMMODITY FLOW PROBLEMS;

DISTRIBUTION OF GOODS;

EID: 0032022012     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.46.2.231     Document Type: Article

References (18)

1. AHUJA, R. K., J. B. ORLIN, AND R. E. TARJAN. 1989. Improved Time Bounds for the Maximum Flow Problem. SIAM J, Comput. 18, 939-954.
2. AHUJA, R. K., A. V. GOLDBERG, J. B. ORLIN, AND R. E. TARJAN. 1992. Finding Minimum-Cost Flows by Double Scaling. Math. Programming, 53, 243-266.
3. AHUJA, R. K., T. L. MAGNANTI, AND J. B. ORLIN. 1993. Network Flows - Theory, Algorithms, and Applications. Prentice-Hall, Inc., Englewood Cliffs, NJ.
4. ALI, I., D. BARNETT, K. FARHANGIAN, J. KENNINGTON, B. PATTY, B. SHETTY, B. MCCARL, AND P. WONG. 1984. Multicommodity Network Problems: Applications and Computations. IIE Trans. 16, 127-134.
5. ALI, A., R. HELGASON, J. KENNINGTON, AND H. LALL. 1980. Computational Comparison Among Three Multicommodity Network Row Algorithms. Opns. Res. 28, 995-1000.
6. ASSAD, A. A. 1976. Multicommodity Network Flows - Computational Experience. Working Paper OR-058-76, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA.
7. ASSAD, A. A. 1978. Multicommodity Network Flows - A Survey. Networks, 8, 37-91.
8. AVRIEL, M. 1976. Nonlinear Programming: Analysis and Methods. Prentice-Hall, Inc., Englewood Cliffs, NJ.
9. BARNHART, C. 1988. A Network-Based Primal-Dual Solution Methodology for the Multicommodity Network Flow Problem. Ph.D. Thesis, Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge, MA.
10. BARNHART, C. 1993. Dual-Ascent Methods for Large-Scale Multicommodity Flow Problems. Naval Res. Logist. Q. 40, 305-324.
11. BARNHART, C. AND Y. SHEFFI. 1993. A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems. Trans. Sci. 27, 2, 102-117.
12. BERTSIMAS, D. AND J. B. ORLIN. 1991. A Technique for Speeding Up the Solution of the Lagrangean Dual. Working Paper No. 3278-91, Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA.
13. CHOI, I. C. AND D. GOLDFARB. 1989. Solving Multicommodity Network Flow Problems by an Interior Point Method. In Proc. of the SIAM Workshop on Large-Scale Numerical Optimization, T. Coleman and Q. Li (eds.).
14. DINIC, E. A. 1973. The Method of Scaling and Transportation Problems. Issledovaniya po Diskretnoi Matematike, Science, Moscow (in Russian).
15. EDMONDS, J. AND R. M. KARP. 1972. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. J. ACM, 19, 248-264.
16. FIACCO, A. V. AND G. P. MCCORMICK. 1968. Nonlinear Programming: Sequential Unconstrained Minimization Techniques. John-Wiley & Sons, New York.
17. SHEFFI, Y. 1976. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice-Hall, Inc., Englewood Cliffs, NJ.
18. VAIDYA, P. M. 1989. Speeding Up Linear Programming Using Fast Matrix Multiplication. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science. 332-337.