Bundle-based relaxation methods for multicommodity capacitated fixed charge network design

Discrete Applied Mathematics

Volumn 112, Issue 1-3, 2001, Pages 73-99

  Crainic, Teodor Gabriel ^a,b   Frangioni, Antonio ^c   Gendron, Bernard ^b,d  

^a UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c UNIVERSITY OF PISA   (Italy)

^d Succursale Centre Ville   (Canada)

Author keywords

Bundle methods; Lagrangian relaxation; Multicommodity capacitated fixed charge network design; Probl me de conception de r seau avec capacit et co t fixe; Relaxation lagrangienne; Subgradient methods

Indexed keywords

EID: 0035885267     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00310-3     Document Type: Article

References (34)

1. Allen E., Helgason R., Kennington J., Shetty B. A generalization of Polyak's convergence result for subgradient optimization. Math. Programming. 37:1987;309-317.
2. A. Balakrishnan, T.L. Magnanti, P. Mirchandani, Network design, in: M. Dell'Amico, F. Maffioli, S. Martello (Eds.), Annotated Bibliographies in Combinatorial Optimization, Wiley, New York, 1997, pp. 311-334 (Chapter 18).
3. Balakrishnan A., Magnanti T.L., Shulman A., Wong R.T. Models for planning capacity expansion in local access telecommunication networks. Ann. Oper. Res. 33:1991;239-284.
4. Bienstock D., Günlük O. Capacitated network design - polyhedral structure and computation. INFORMS J. Comp. 8(3):1996;243-259.
5. Camerini P.M., Fratta L., Maffioli F. On improving relaxation methods by modified gradient techniques. Math. Programming Study. 3:1975;26-34.
6. Chang S.-G., Gavish B. Lower bounding procedures for multiperiod telecommunications network expansion problems. Oper. Res. 43(1):1995;43-57.
7. T.G. Crainic, A. Frangioni, B. Gendron, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design problems, Publication CRT-98-45, Centre de recherche sur les transports, Université de Montreal, 1998.
8. T.G. Crainic, M. Gendreau, J. Farvolden, Simplex-based tabu search for the multicommodity capacitated fixed charge network design problem, INFORMS J. Comput. 12(3) (2000).
9. Crowder H. Computational improvements for subgradient optimization. Symposia Mathematica. Vol. XIX:1976;Academic Press, London.
10. O. du Merle, J.-L. Goffin, C. Trouiller, J.-P. Vial, A Lagrangian relaxation of the capacitated multi-item lot sizing problem solved with an interior point cutting plane algorithm, Research Report 97-5, Logilab, University of Geneva, 1998.
11. du Merle O., Goffin J.-L., Vial J.-P. On improvements to the analytic center cutting plane method. Comput. Optim. Appl. 11:1998;37-52.
12. Frangioni A. Solving semidefinite quadratic problems within nonsmooth optimization algorithms. Comput. Oper. Res. 23(1):1996;1099-1118.
13. A. Frangioni, Dual-ascent methods, and multicommodity flow problems, Ph.D. Thesis, Dipartimento di informatica, Università di Pisa, 1997.
14. A. Frangioni, Generalized bundle methods, Technical Report TR-98-04, Dipartimento di informatica, Universitá di Pisa, 1998.
15. Frangioni A., Gallo G. A bundle type dual-ascent approach to linear multicommodity min cost flow problems. INFORMS J. Comp. 11(4):1999;370-393.
16. Gavish B. Topological design of telecommunications network - local access design methods. Ann. Oper. Res. 33:1991;17-71.
17. B. Gendron, T.G. Crainic, Relaxations for multicommodity capacitated network design problems, Publication CRT-965, Centre de recherche sur les transports, Université de Montréal, 1994.
18. B. Gendron, T.G. Crainic, Bounding procedures for multicommodity capacitated fixed charge network design problems, Publication CRT-96-06, Centre de recherche sur les transports, Université de Montréal, 1996.
19. Gendron B., Crainic T.G., Frangioni A. Multicommodity capacitated network design. Sansó B., Soriano P. Telecommunications Network Planning. 1998;1-19 Kluwer Academics Publishers, Dordrecht.
20. Geoffrion A.M. Lagrangean relaxation for integer programming. Math. Programming Study. 2:1974;82-114.
21. Goffin J.-L., Gondzio J., Sarkissian R., Vial J.-P. Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. Math. Programming. 76:1996;131-154.
22. Goffin J.-L., Haurie A., Vial J.-P. Decomposition and nondifferentiable optimization with the projective algorithm. Management Sci. 38(2):1992;284-302.
23. Gondran M., Minoux M. Graphes et Algorithmes. 1979;Eyrolles, Paris.
24. Held M., Wolfe P., Crowder H.P. Validation of subgradient optimization. Math. Programming. 6:1974;62-88.
25. Hiriart-Urruty J.B., Lemaréchal C. Convex analysis and minimization algorithms II. A Series of Comprehensive Studies in Mathematics. Vol. 306:1993;Springer, Berlin.
26. K. Holmberg, D. Yuan, A Lagrangean heuristic based branch-and-bound approach for the capacitated network design problem, Research Report LiTH-MAT-R-1996-23, Department of Mathematics, Linköping Institute of Technology, Oper. Res. (1996) forthcoming.
27. Kelley J.E. The cutting-plane method for solving convex programs. J. SIAM. 8:1960;703-712.
28. Larsson T., Patriksson M., Strömberg A.-B. Conditional subgradient optimization - theory and applications. European J. Oper. Res. 88:1996;382-403.
29. C. Lemaréchal, Nondifferentiable optimization, in: G.L. Nemhauser, A.H.G. Rinnoy Kan, M.J. Todd (Eds.), Handbooks in Operations Research and Management Science, Chapter 7, Optimization, Vol. 1, 1989, pp. 529-572.
30. Magnanti T.L., Mirchandani P., Vachani R. Modeling and solving the two-facility capacitated network loading problem. Oper. Res. 43(1):1995;142-157.
31. Magnanti T.L., Wong R.T. Network design and transportation planning: models and algorithms. Transportation Sci. 18(1):1984;1-55.
32. Minoux M. Network synthesis and optimum network design problems: models, solution methods and applications. Networks. 19:1989;313-360.
33. Polyak B.T. Minimization of nonsmooth functionals. USSR Comput. Math. and Math. Phys. 9:1969;14-29.
34. Schramm H., Zowe J. A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results. SIAM J. Optim. 2(1):1992;121-152.