A Survey of Algorithms for Convex Multicommodity Flow Problems

Management Science

Volumn 46, Issue 1, 2000, Pages 126-147

  Ouorou, A ^a  

^a UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; GRAPH THEORY; MATHEMATICAL MODELS; NONLINEAR PROGRAMMING; VECTORS;

CONVEX PROGRAMMING; MESSAGE ROUTING; MULTICOMMODITY FLOWS; NETWORK OPTIMIZATION;

OPTIMIZATION;

EID: 0033872128     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.46.1.126.15132     Document Type: Article

References (69)

1. Ahuja, R. V., T. L. Magnanti, J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englevvood Cliffs, NJ.
2. Assad, A. 1978. Multicommodity network flows-a survey. Netivorks 8 37-91.
3. Authie, G. 1987. Contribution àl'optimisation de flots dans les réseaux. Un multiprocesseur expérimental pour l'étude des itérations asynchrones. Thèse de doctorat d'état, LAAS, Toulouse, France.
4. Bertsekas, D. P. 1982. Projected Newton methods for optimization problems with simple constraints. Siam J. Control Optim. 20 221-246.
5. _, E. M. Garni. 1983. Projected Newton methods and optimization of multicommodity flows. IEEE Trans. Automat. Contr. AC-28 1090-1096.
6. _, R. Gendron, W. K. Tsai. 1984. Implementation of an optimal multicommodity network flow algorithm based on gradient projection and a path flow formulation. Report LIDS-P-1364. MIT Laboratory for Information and Decision Systems, Cambridge, MA.
7. _, R. G. Gallager. 1987. Data Networks. Prentice-Hall, Englewood Cliffs, NJ.
8. _, J. N. Tsitsiklis. 1989. Parallel and Distributed Computation. Prentice-Hall, Englewood Cliffs, NJ.
9. Cantor, D., M. Gerla. 1974. Optimal routing in a packet-switched computer network. IEEE Trans. Compitt. C-23 (10) 1062-1069.
10. Cheney, W., A. Goldstein. 1959. Newton's method for convex programming and Chebishev approximation. Num. Math. 1 (5) 253-268.
11. Chifflet, J., P. Mahey, V. Reynier. 1994. Proximal decomposition for multicommodity flow problems with convex costs. Telecommunication Systems 3 1-10.
12. Choi, I. C, D. Goldfarb. 1990. Solving multicommodity network flow problems by an interior point method. F. Coleman, Yuying Li eds. Large-Scale Numerical Optimization. SIAM 58-69.
13. Dantzig, G. B., P. Wolfe. 1961. The decomposition algorithm for linear programming. Econometrica 29 (4) 767-778.
14. du Merle, O., J. L. Coffin, J. P. Vial. 1998. On improvements to the analytic center cutting plane method. Comput. Optim. Applications 11 37-52.
15. Eckstein, J. E. 1989. Splitting methods for monotone operators with applications to parallel optimization. Ph.D. Thesis, Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge, MA.
16. _, M. Fukushima. 1993. Some reformulations and applications of the alternating direction method of multipliers. Large Scale Optimization: State of the Art. Kluwer Academic Publishers B.V., The Netherlands, 119-138.
17. _. 1994. Parallel alternating direction multiplier decomposition of convex programs. J. Optim. Theory and Applications 80 39-62.
18. Farvolden, J. M., W. B. Powell, I. J. Lustig. 1993. A primal partitioning solution for the arc-chain formulation of a multicommodity network flow problem. Oper. Res. 41 (4) 669-693.
19. Florian, M., J. Guelat, H. Spiess. 1987. An efficient implementation of the PARTAN variant of the linear approximation method for network equilibrium problem. Networks 17 319-339.
20. Ford, L. R., D. R. Fulkerson. 1962. Flows in Networks. Princeton University Press, Princeton, NJ.
21. Franck, M., P. Wolfe. 1956. An algorithm for quadratic programming. Naval Res. Logist. Quart. 3 95-110.
22. Fratta, L., M. Gerla, L. Kleinrock. 1973. The flow deviation method: An approach to store-and-forward communication network design. Networks, 3 97-133.
23. Fukushima, M. 1984. A nonsmooth optimization approach to nonlinear multicommodity network flow problems. J. Oper. Res. Soc. Japan 27 (2) 151-177.
24. Gabrel, V., M. Minoux. 1996. Large scale LP relaxations for minimum cost multicommodity flow problems with step increasing cost functions and computational results. Technical Report 96/17, Laboratoire MASI, Université Paris 6, France.
25. de Ghellinck, G., J.-P. Vial. 1986. A polynomial Newton method for linear programming. Algorithmica 1 425-453.
26. Coffin, J.-L., J. Gondzio, R. Sarkissian, J. P. Vial. 1997. Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. Math. Programming 76 131-154.
27. _, A. Haurie, J.-P. Vial. 1992. Decomposition and nondifferentiable optimization with the projective algorithm. Management Sci. 38 (2) 284-302.
28. Goldberg, A. V., R. E. Tarjan. 1989. Finding minimum cost circulations by canceling negatives cycles. J. Assoc. Comput. Mach. 36 (4) 873-886.
29. Gondran, M., M. Minoux. 1979. Graplies et Algorithmes. Eyrolles, France.
30. Gondzio, J., R. Sarkissian, J.-P. Vial. 1997. Using an interior point method for the master problem in a decomposition approach. European J. Oper. Res. 101 (3) 577-587.
31. Hossein, P. A., D. P. Bertsekas, P. Tseng. 1987. Relaxation methods for network flow problems with convex arc costs. S/AM. J. Control Optim. 5 (25) 1219-1243.
32. Hu, T. C. 1963. Multi-commodity network flows. Oper. Res 11344-360.
33. Ibaraki, S., M. Fukushima. 1994. Primal-dual proximal point algorithm for multicommodity network flow problems. J. Oper. Res. Soc. Japan 37 (4) 297-309.
34. Idrissi, H., O. Lefebvre, C. Michelot. 1989. Applications and numerical convergence of the partial inverse method. Optimization, Lecture Notes in Math. 1405. Springer Verlag, Germany, 39-54.
35. Jones, K. L., I. J. Lustig, J. M. Farvolden, W. B. Powell. 1993. Multicommodity network flows: The impact of formulation on decomposition. Math. Programming 62 95-117.
36. Karzanov, A. V., S. T. McCormick. 1997. Polynomial methods for separable convex optimization in totally unimodular linear spaces with applications to circulations and co-circulations in networks. SIAM J. Comput. 26 1245-1275.
37. Kelley, J. E. 1960. The cutting plane method for solving convex programs. J. Soc. Indust. Appl. Math. 8 703-712.
38. Kennington, J. F. 1978. A survey of linear cost multicommodity network flows. Oper. Res. 2 (26) 209-236.
39. Kleinrock, L. 1964. Communication Nets: Stochastic Message Flow and Delay. McGraw-Hill, New York.
40. Lasdon, L. S. 1970. Optimization Tlieoryfor Large Systems. Macmillan, New York.
41. LeBlanc, L. 1973. Mathematical programming algorithms for large scale network equilibrium and network design problems. Ph.D. Dissertation, IE/MS Dept., Northwestern University, Evanston IL.
42. _, E. Morlok, W. Pierskalla. 1975. An efficient approach to solving the road network equilibrium traffic assignment problem. Trans. Res. 9 309-318.
43. _, R. Helgason, D. E. Boyce. 1985. Improved efficiency of the Frank-Wolfe algorithm for convex network programs. Transportation Sci. 19 445-462.
44. Lemaréchal, C. 1974. Méthodes de sous-gradients. Bulletin de la Direction des Etudes et Recherches EDF C (2) 5-14.
45. Mahey, P., S. Oualibouch, D. T. Pham. 1995. Proximal decomposition on the graph of a maximal monotone operator. SJAM J. Optim. 5 (2) 454-466.
46. _, A. Ouorou, L. LeBlanc, J. Chifflet. 1998. A new proximal decomposition algorithm for routing in telecommunication networks. Networks 31 227-238.
47. Medhi, D. 1994. Bundle-based decomposition for large scale convex optimization: Error estimate and application block-angular linear programs. Math. Programming 66 (1) 79-102.
48. Minoux, M. 1989. Network synthesis and optimum network design problems: Models, solution methods and applications. Networks, Vol. 19, John VViley & Sons, New York, 313-360.
49. Nagamochi, H. 1988. Studies on multicommodity flows in directed networks, thesis, Eng. Dr. thesis, Kyoto University, Japan.
50. Ouorou, A. 1995. Décomposition proximale des problèmes de multiflot àcritère convexe. Application aux problèmes de routage dans les réseaux de communication. Thèse Doctorale, Université Biaise Pascal, Clermont-Ferrand, France.
51. Ouorou, A., P. Mahey. 1996. Minimum mean cycles canceling method for nonlinear multicommodity flow problems. European J. Oper. Res. Forthcoming.
52. Patriksson, M. 1994. The traffic assignment problem: models and methods. Topics in Transportation, VSP, Utrecht, The Netherlands.
53. Pinar, M. C, S. Zenios. 1992. Parallel decomposition of multicommodity network flows using a linear quadratic penalty algorithm. ORSA J. Computing 4 (3) 235-249.
54. _, S. A. Zenios. 1993. A comparative study of parallel decompositions for multicommodity flow problems. Parallel Algorithms and Applications 1 255-271.
55. Rockafellar, R. T. 1976. Monotone operators and the proximal point algorithm. SIAM. J. Control and Optim. 14 877-898.
56. _. 1970. Convex Analysis, Princeton University Press, Princeton, NJ.
57. _. 1976. Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 197-116.
58. Schultz, G. L., R. R. Meyer. 1991. An interior point method for block angular optimization. SIAM J. Optim. 1 (4) 583-602.
59. Schwartz, M., C. Cheung. 1976. The gradient projection algorithm for multiple routing in message-swicthed networks. IEEE Trans, on Communications COM-24 449-456.
60. _, T. E. Stern. 1980. Routing techniques used in computer communication networks. IEEE Trans, on Communications COM-28 539-552.
61. Spingarn, J. E. 1983. Partial inverse of a monotone operator. Appl. Math. Optim. 10 247-265.
62. _. 1985. Applications of the method of partial inverse to convex progr decomposition, Math. Programming 32 199-223.
63. Stern, T. E. 1977. A class of decentralized routing algorithms using relaxation. IEEE Trans. Communications COM-25 1092-1102.
64. Tseng, P. 1990. Dual ascent methods for problems with strictly convex costs and linear constraints: A unified approach, SIAM J. Control and Optim. 28 214-242.
65. _, D. P. Bertsekas. 1987. Relaxation methods for problems with strictly convex separable arc costs and linear constraints. Math. Programming 38 303-321.
66. Von Hohenbalken, B. 1977. Simplicial decomposition in nonlinear programming algorithms. Math. Programming 13 49-68.
67. Wolfe, P. 1975. A method of conjugate subgradients for minimizing nondifferentiable functions, Nondifferentiable Optimization, Math. Programming Study 3 145-173.
68. Zangwill, W. 1969. Nonlinear Programming: A Unified Approach, Prentice-Hall, Englewood Cliffs, NJ.
69. Zenios, S. A., Y. Censor. 1991. Massively parallel row-action algorithms for some nonlinear transportation problems. SIAM J. Optim. 1 373-400.