Dual ascent for uncapacitated telecommunications network design with access, backbone, and switch costs

Telecommunication Systems

Volumn 16, Issue 3-4, 2001, Pages 423-435

  Rosenberg, Eric ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Design; Dual ascent; Network; Telecommunications; Uncapacitated

Indexed keywords

EID: 26444549103     PISSN: 10184864     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. A. Balakrishnan, T.L. Magnanti and R.T. Wong, A dual-ascent procedure for large-scale uncapacitated network design, Operations Research 37 (1989) 716-740.
2. O. Bilde and J. Krarup, Sharp lower bounds and efficient algorithms for the simple plant location problem, Annals of Discrete Mathematics 1 (1977) 79-97.
3. S. Chamberland, B. Sanso and O. Marcotte, Topological design of two level telecommunication networks with modular switches, GERAD (Montréal), Report G-97-29 (1997).
4. S.H. Chung, Y.S. Myung and D.W. Tcha, Optimal design of a distributed network with a two-level hierarchical structure, European Journal of Operational Research 62 (1992) 105-115.
5. D. Erlenkotter, A dual based procedure for uncapacitated facility location, Operations Research 26 (1978) 992-1009.
6. R.L. Francis, L.F. McGinnis, Jr. and J.A. White, Facility Layout and Location: An Analytical Approach (Prentice-Hall, Englewood Cliffs, NJ, 1992).
7. B. Gavish, Topological design of computer communication networks - The overall problem, European Journal of Operational Research 58 (1992) 149-172.
8. B. Gavish and H. Pirkul, Computer and database location in distributed systems, IEEE Transactions on Computers 35 (1986) 583-589.
9. J.G. Kim and D.W. Tcha, Optimal design of a two-level hierarchical network with tree-star configuration, Computers and Industrial Engineering 22 (1992) 273-281.
10. L. Kou, G. Markowsky and L. Berman, A fast algorithm for steiner trees, Acta Informatica 15 (1981) 141-145.
11. C. Lee, H. Ro and D. Tcha, Topological design of a two-level network with ring-star configuration, Computers and Operations Research 20 (1993) 625-637.
12. A. Lucena and J.E. Beasley, A branch and cut algorithm for the Steiner problem in graphs, Networks 31 (1998) 39-59.
13. A. Mirzaian, Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds, Networks 15 (1985) 1-20.
14. R.T. Wong, A dual ascent approach for Steiner tree problems on a directed graph, Mathematical Programming 28 (1984) 271-287.