D.C. programming approach for multicommodity network optimization problems with step increasing cost functions

Journal of Global Optimization

Volumn 22, Issue 1-4, 2002, Pages 205-232

  Hoai An, Le Thi ^a   Tao, Pham Dinh ^a  

^a UNIVERSITÉ ET INSA DE ROUEN   (France)

Author keywords

Capacity assignment problem; D.c. (difference of convex functions) program; DCA (d.c. algorithm); Flow assignment problem; Mixed integer linear program; Multicommodity network flows; Polyhedral d.c. program; Relaxation techniques; Step increasing cost function

Indexed keywords

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING;

CAPACITY ASSIGNMENT; DCA (D.C. ALGORITHM); DIFFERENCE OF CONVEX FUNCTIONS; FLOW ASSIGNMENT; INCREASING COSTS; MIXED INTEGER LINEAR PROGRAM; MULTI-COMMODITY NETWORK FLOWS; POLYHEDRAL D.C. PROGRAM; RELAXATION TECHNIQUES;

COST FUNCTIONS;

EID: 31244434168     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1023/a:1013867331662     Document Type: Article

References (42)

1. K.T. Ahuja, T. Magnanti and J. Orlin. Networks Flows: Theory, Algorithms and Applications. Prentice Hall, 1993
2. A.A. Assad. Multicommodity network flows-A survey. Networks8: 37–91, 1978
3. A. Balakrisnan and S.C. Graves. A composite algorithm for a concave-cost network flow problem. Networks19: 175–202, 1989
4. D.P. Bertsekas and R.G. Gallager. Data Netwoks. Prentice Hall, 1987
5. F. Boyer. Conception et Routage des Réseaux de Télécommunications. Thèse de Doctorat de l’Université Blaise Pascal, Clermont -Ferrand, 1997
6. V.J.M. Ferreira Filho and R.D. Galvao. A Survey of Computer Network Design Problems. Investigacion Operativa4: 183–211, 1994
7. L. Fratta, M. Gerla and L. Kleinrock. The flow deviation method: an approach to store-andforward communications network design. Networks3: 97–133, 1973
8. V. Gabrel and M. Minoux. Large scale LP relaxations for minimum cost multicommodity flow problems with step increasing cost functions and computational results. Technical Report, Laboratoire MASI, Univ. Paris 6, 1996
9. V. Gabrel and M. Minoux. LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions. Acta Mathematica Vietnamica22: 128–145, 1997
10. B. Gavish. Augmented Lagrangian based bounds for centralized network design. IEEE Transactions on Communications COM-33, 1247–1257, 1985
11. B. Gavish and K. Altinkemer. Backbone network design tools with economic tradeoffs ORSAJ. on Computing 2/3: 236–252
12. B. Gavish and G.W. Graves. System for routing and capacity assignment in computer communication network. IEEE Transactions on Communications COM-37: 360–366, 1989
13. M. Gerla and L. Kleinrock. On the tological design of distributed computer networks. IEEE Transactions on Communications COM-25: 48–60, 1977
14. M. Gerla The Design of Store-and-Forward Networks for Computer Communications. PhD Thesis, UCLA, 1973
15. M. Gerla and L. Keinrock. On the topological design of distributed computer networks. IEEE Transactions on Communications COM-25: 48–60, 1977
16. M. Gerla, R. Monteiro and R. Pazos, Topology design and bandwith allocation in ATM nets. IEEE transactions on selected Area in Communications SAC-7, 1989
17. M. Gondran and M. Minoux. Graphes et Algorithmes Eyrolles, Paris 2nd edition 1995
18. J.B. Hiriart Urruty and C. Lemarechal Convex Analysis and Minimization Algorithms. Springer, Berlin, 1993
19. P.J. Laurent. Approximation et Optimisation. Hermann, Paris, 1972
20. R. Horst, P.M. Pardalos and V.T. Nguyen. Introduction to Global Optimization, Kluwer, Dordrecht, 1995
21. R. Horst and V.T. Nguyen. D.C. Programming: Overview. Journal of Optimization Theory and Applications, 103: 1–43, 1999
22. J.L. Kennington. A survey of linear cost multicommodity network flows. Operations Research26: 209–236, 1978
23. H.A. Le Thi. Contribution à l’optimisation non convexe et l’optimisation globale: Théorie, Algorithmes et Applications. Habilitation à Diriger des Recherches, Université de Rouen, 1997
24. H.A. Le Thi and T. Pham Dinh. Solving a class of linearly constrained indefinite quadratic problems by D.c. algorithms. Journal of Global Optimization11: 253–285, 1997
25. H.A. Le Thi and T. Pham Dinh. D.c. models of real world nonconvex optimization problems. Technical Report, LMI, INSA-Rouen, 1998
26. H.A. Le Thi and T. Pham Dinh. D.c. programming approach for large-scale molecular optimization via the general distance geometry problem, in Optimization in Computational Chemistry and Molecular Biology: Local and Global Approaches, C.A. Floudas and P.M. Pardalos (Eds.), pp. 301–339, Kluwer Academic Publishers, Dordrecht, 2000
27. H.A. Le Thi and T. Pham Dinh, A continuous approach for large-scale linearly constrained quadratic zero-one programming. Optimization, 45(3) 1–28, 2001
28. J. Mac Gregor Smith and P. Winter (eds). Topological NetWork Design. Annals of Operations Research33, 1991
29. P. Mahey and T. Pham Dinh. Proximal decomposition on the graph of a maximal monotone operator. SIAM Journal on Optimization, 5: 454–468, 1995
30. T.Q. Nguyen. Une approche D.c. en Optimisation dans les Réseaux. Algorithmes, Codes et Simulations Numériques. PhD Thesis, Université de Rouen, 1999
31. P. Mahey, A. Ourou, L. Leblanc and J. Chifflet. A new proximal decomposition algorithm for routing in telecommunications networks. Networks31: 227–338, 1998
32. P. Mahey and H.P.L. Luna. Bounds for Global Optimization of Capacity Expansion and Flow Assignment Problems. to appear in Operations Research Letters
33. P. Mahey and H.P.L. Luna. Separable convexification techniques for capacity and flow assignment problems. To appear
34. V.T. Nguyen. D.C. Programming. in Encyclopedia of Optimization Kluwer Academic Publishers, Dordrecht
35. M. Minoux. Network synthesis and Optimum Network design problems: Models, Solution Methods and Applications. Networks 19: 313-360, 1989
36. A. Ouorou. Décomposition proximale des problèmes de multiflots à critère convexe- Applications aux problèmes de routage dans les réseaux de communications. Thèse de Doctorat, Université de Clermont-Ferrand, 1995
37. T. Pham Dinh and H.A. Le Thi. Convex analysis approach to d.c. programming: Theory, Algorithms and Applications (dedicated to Professor Hoang Tuy on the occasion of his 70th birthday). Acta Mathematica Vietnamica. 22(1): 289–355
38. T. Pham Dinh and H.A. Le Thi. D.c. optimization algorithms for trust region problem. SIAM J. Optimization, 8(2): 476–505
39. R.T. Rockafellar. Convex Analysis. Princeton University, Princeton 1970
40. R.T. Rockafellar. Monotone operators and the proximal point algorithm. SIAM J. Control and Optimization, 14(5): 877–898
41. B. Sanso, F. Soumis and M. Gendreau. On the evaluation of telecommunication networks reliability using routing models. IEEE Transactions on Communications COM-3, 1494-1501
42. J.F. Toland. On subdifferential calculus and duality in nonconvex optimization. Bull. Soc. Math. France Mémoire 60: 173–180.