A Lagrangean approach to network design problems

International Transactions in Operational Research

Volumn 5, Issue 6, 1998, Pages 529-539

  Holmberg, K ^a   Yuan, D ^a  

^a LINKÖPING INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Branch and bound; Lagrangean heuristic; Mixed integer programming; Network design

Indexed keywords

EID: 0042086799     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.1998.tb00135.x     Document Type: Article

References (26)

1. Alevras, D., Grötschel, M., Wessäly, R., 1997. Cost-efficient network synthesis from leased lines. Technical Report. Preprint SC 97-22, Konrad-Zuse-Zentrum fur Informationstechnik, Berlin.
2. Balakrishnan, A. Magnanti, T.L. Wong, R.T., 1989. A dual-ascent procedure for large-scale uncapacitated network design. Operations Research 37, 716-740.
3. Barnhart, C., 1993. Dual-ascent methods for large-scale multicommodity flow problems. Naval Research Logistics 40, 305-324.
4. Bazaraa, M.S. Sherali, H.D., 1981. On the choice of step size in subgradient optimization. European Journal of Operational Research 7, 380-388.
5. Bienstock, D., Chopra, S., Günlük, O., Tsai, C.Y., 1995. Minimum cost capacity installation for multicommodity network flows. Technical Paper.
6. Busacker, R., Gowen, P., 1961. A procedure for determining a family of minimum-cost network flow patterns. ORO Technical Report 15, John Hopkins University.
7. Crowder, H., 1976, Computational improvements for subgradient optimization. Symposia Mathematica, Vol. XIX. Academic Press, London, pp. 357-372.
8. Dahl, G., Stoer, M., 1996. A cutting plane algorithm for multicommodity survivable network design problems. Technical Report, Institute of Informatics, University of Oslo, Norway.
9. Gallo, G. Pallottino, S., 1988. Fortran codes for network optimization: Shortest path algorithms. Annals of Operations Research 13, 3-79.
10. Gendron, B., Crainic, T.G., 1994. Relaxations for multicommodity capacitated network design problems. Research report CRT-965, Centre de Recherche sur les Transports, Universite de Montreal, Canada.
11. Gendron, B., Crainic, T.G., 1995. Bounding procedures for multicommodity capacitated fixed charge network design problems. Research report CRT-95-12, Centre de Recherche sur les Transports, Universite de Montreal, Canada.
12. Günlük, O., 1996. A branch-and-cut algorithm for capacitated network design problems. Technical Report, School of ORIE, Cornell University, Ithaca, New York.
13. Held, M. Wolfe, P. Crowder, H.P., 1974. Validation of subgradient optimization. Mathematical Programming 6, 62-88.
14. Holmberg, K., 1995. Lagrangean heuristics for linear cost multicommodity network flow problems. Working paper LiTH-MAT/OPT-WP-1995-01, Division of Optimization, Department of Mathematics, Linkoping Institute of Technology, Sweden.
15. Holmberg, K. Hellstrand, J., 1998. Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound. Operations Research 46, 247-259.
16. Holmberg, K. Ling, J., 1997. A Lagrangean heuristic for the facility location problem with staircase costs. European Journal of Operational Research 97, 63-74.
17. Holmberg, K., Yuan, D., 1996. A Lagrangean heuristic based branch-and-bound approach for the capacitated network design problem. Research Report LiTH-MAT-R-1996-23, Department of Mathematics, Linkoping Institute of Technology, Sweden.
18. Holmberg, K., Yuan, D., 1998. A Lagrangean heuristic applied to capacitated network design with staircase costs and/or survivability requirements. Working paper, Department of Mathematics, Linkoping Institute of Technology, Sweden.
19. Iri, M., 1960. A new method for solving transportation-network problems. Journal of the OR Society of Japan 3, 27-87.
20. Jewell, W., 1958. Optimal flow through network. Technical report 8, OR Center, MIT, Cambridge, MA.
21. Lamar, B.W. Sheffi, Y. Powell, W.B., 1990. A capacity improvement lower bound for fixed charge network design problems. Operations Research 38, 704-710.
22. Magnanti, T.L. Wong, R.T., 1984. Network design and transportation planning: Models and algorithms. Transportation Science 18, 1-55.
23. Minoux, M., 1989. Network synthesis and optimum network design problems: Models, solution methods and applications. Networks 19, 313-360.
24. Nemhauser, G. Wolsey, L., 1988. Integer and Combinatorial Optimization. John Wiley and Sons, Chichester, New York.
25. Poljak, B.T., 1969. Minimization of unsmooth functionals. USSR Computational Mathematics and Mathematical Physics 9, 14-29.
26. Stoer, M. Dahl, G., 1994. A polyhedral approach to multicommodity survivable network design. Numerische Mathematik 68, 149-167.