An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1412, Issue , 1998, Pages 338-352

  Goldberg, Andrew V ^a   Oldham, Jeffrey D ^b   Plotkin, Serge ^b   Stein, Cliff ^c  

^a NEC LABORATORIES AMERICA   (United States)

^b Stanford University   (United States)

^c Dartmouth Department of Computer Science_Dartmouth College   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; COSTS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION;

CAPACITY CONSTRAINTS; LINEAR PROGRAMMING ALGORITHM; LINEAR PROGRAMMING PACKAGES; MINIMUM COST MULTI-COMMODITY FLOW PROBLEM; MULTI-COMMODITY FLOW; MULTICOMMODITY FLOW PROBLEMS; MULTICOMMODITY FLOW PROGRAMS; THREE ORDERS OF MAGNITUDE;

APPROXIMATION ALGORITHMS;

EID: 84958757020     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69346-7_26     Document Type: Conference Paper

References (29)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993.
2. I. Adler, M. G. C. Resende, G. Veiga, and N. Karmarkar. An implementation of Karmarkar’s algorithm for linear programming. Mathematical Programming A, 44(3):297-335, 1989.
3. A. A. Assad. Multicommodity network flows -A survey. Networks, 8(1):37-91, Spring 1978.
4. T. Badics. GENRMF. 1991. ftp://dimacs.rutgers.edu/pub/netflow/ generators/network/genrmf/
5. J. Castro and N. Nabona. An implementation of linear and nonlinear multicommodity network flows. European Journal of Operational Research, 92(1):37-53, 1996.
6. CPLEX Optimization, Inc., Incline Village, NV. Using the CPLEX Callable Library, 4.0 edition, 1995.
7. G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, Princeton, NJ, 1963.
8. M. D. Grigoriadis and L. G. Khachiyan. Approximate minimum-cost multicommodity flows in Õ(e-2knm) time. Mathematical Programming, 75(3):477-482, 1996.
9. A. V. Goldberg. A natural randomization strategy for multicommodity flow and related algorithms. Information Processing Letters, 42(5):249-256, 1992.
10. A. Goldberg, J. D. Oldham, S. Plotkin, and C. Stein. An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow. Technical Report CS-TR-97-1600, Stanford University, December 1997.
11. M. D. Grigoriadis. An efficient implementation of the network simplex method. Mathematical Programming Study, 26:83-111, 1986.
12. R. W. Hall and D. Lotspeich. Optimized lane assignment on an automated highway. Transportation Research—C, 4C(4):211-229, 1996.
13. A. Haghani and S.-C. Oh. Formulation and solution of a multi-commodity, multi-modal network flow model for disaster relief operations. Transportation Research—A, 30A(3):231-250, 1996.
14. N. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 4(4):373-395, 1984.
15. J. L. Kennington and R. V. Helgason. Algorithms for Network Programming. John Wiley & Sons, New York, 1980
16. L. G. Khachiyan. Polynomial algorithms in linear programming. Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki (Journal of Computational Mathematics and Mathematical Physics), 20(1):51-68, 1980.
17. A. Kamath and O. Palmon. Improved interior point algorithms for exact and approximate solution of multicommodity flow problems. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, Vol. 6, pages 502-511. Association for Computing Machinery, January 1995.
18. D. Karger and S. Plotkin. Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows. In Symposium on the Theory of Computing, Vol. 27, pages 18-25. Association for Computing Machinery, ACM Press, May 1995.
19. P. Klein, S. Plotkin, C. Stein, and É. Tardos. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. SIAM Journal on Computing, 23(3):466-487, 1994.
20. S. Kapoor and P. M. Vaidya. Fast algorithms for convex quadratic programming and multicommodity flows. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing, Vol. 18, pages 147-159. Association for Computing Machinery, 1986.
21. T. Leighton, F. Makedon, S. Plotkin, C. Stein, É. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. Journal of Computer and System Sciences, 50(2):228-243, 1995.
22. Y. Lee and J. Orlin. GRIDGEN. 1991. ftp://dimacs.rutgers.edu/pub/netflow/generators/network/gridgen/
23. T. Leong, P. Shor, and C. Stein. Implementation of a combinatorial multicommodity flow algorithm. In David S. Johnson and Catherine C. Mc-Geoch, editors, Network Flows and Matching, Series in Discrete Mathematics and Theoretical Computer Science, Vol. 12, pages 387-405. American Mathematical Society, 1993.
24. W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling. Numerical Recipes in C. Cambridge University Press, Cambridge, 1988.
25. S. A. Plotkin, D. B. Shmoys, and E. Tardos. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research, 20(2):257-301, 1995.
26. T. Radzik. Fast deterministic approximation for the multicommodity flow problem. Mathematical Programming, 78(1):43-58, 1997.
27. J. Raphson. Analysis AEquationum Universalis, seu, Ad JEquationes Al-gebraicas Resolvendas Methodus Generalis, et Expedita. Prostant venales apud Abelem Swalle, London, 1690.
28. R. Schneur. Scaling Algorithms for Multicommodity Flow Problems and Network Flow Problems with Side Constraints. PhD thesis, MIT, Cambridge, MA, February 1991.
29. P. M. Vaidya. Speeding up linear programming using fast matrix multiplication. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Vol. 30, pages 332-337. IEEE Computer Society Press, 1989.