Heuristics for distribution network design in telecommunication

Journal of Heuristics

Volumn 6, Issue 1, 2000, Pages 131-148

  Mateus, Geraldo R ^a   Luna, Henrique P L ^a   Sirihal, Adriana B ^a  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER AIDED DESIGN; CONGESTION CONTROL (COMMUNICATION); CONSTRAINT THEORY; GRAPH THEORY; HEURISTIC METHODS; TELECOMMUNICATION TRAFFIC;

COMPUTER AIDED DISTRIBUTION NETWORK DESIGN; LAGRANGIAN HEURISTICS;

TELECOMMUNICATION NETWORKS;

EID: 0033875899     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009669927855     Document Type: Article

References (28)

1. Agrawal, A., P.N. Klein, and R. Ravi. (1994). "When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks." Technical Report CS-90-32, Department of Computer Science, Brown University, Providence, Rhode Island 02912.
2. Aneja, Y.P. (1980). "An Integer Linear Programming Approach to Steiner Problem in Graphs," Networks 10, 167-178.
3. Balakrishnan, A., T.L. Magnanti, and P. Mirchandani. (1994). "Modeling and Heuristic Worst-Case Performance Analysis of Two-Level Network Design Problem," Management Science 40, 846-867.
4. Balakrishnan, A., T.L. Magnanti, A. Shulman, and R.T. Wong. (1991). "Models for Planning Capacity Expansion in Local Access Telecommunication Networks," Annals of Operations Research 33, 239-284.
5. Balakrishnan, A., T.L. Magnanti, and R.T. Wong. (1989). "A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design," Operations Research 37, 716-740.
6. Beasley, J.E. (1988). "An Algorithm for Solving Large Capacitated Warehouse Location Problems," Journal of the Operational Research Society 33, 314-325.
7. Beasley, J.E. (1989). "An sst-Based Algorithm for the Steiner Problem in Graphs," Networks 19, 1-16.
8. Bienstock, D. and O. Günlük. (1995). "Computational Experience with a Difficult Mixed-Integer Multicommodity Flow Problem," Mathematical Programming 68, 213-237.
9. Bradley, G.H., G.G. Brown, and G.W. Graves. (1977). "Design and Implementation of Large Scale Primal Transshipment Algorithms," Management Science 24, 1-34.
10. Duin, C.W. and A. Volgenant. (1989). "Reduction Tests for the Steiner Problem in Graphs," Networks 19, 549-567.
11. Fisher, M.L. (1981). "The Lagrangean Relaxation Method for Solving Integer Programming Problems," Management Science 27, 1-18.
12. Fisher, M.L. (1985). "An Application Oriented Guide to Lagrangean Relaxation," Interfaces 15, 10-21.
13. Gavish, B. (1982). "Topological Design of Centralized Computer Networks - Formulations and Algorithms," Networks 12, 355-377.
14. Gavish, B. (1983). "Formulations and Algorithms for the Capacitated Minimal Directed Tree," Journal of the ACM 30, 118-132.
15. Gavish, B. (1991). "Topological Design of Telecommunication Networks - Local Access Design Methods," Annals of Operations Research 33, 17-71.
16. Geoffrion, A.M. and R. McBride. (1978). "Lagrangean Relaxation Applied to Capacitated Facility Location Problems," AIIE Transactions 10, 40-47.
17. Hakimi, S.L. (1971). "Steiner's Problem in Graphs and its Implications," Networks 1, 113-133.
18. Hochbaum, D.S. and A. Segev. (1989). "Analysis of a Flow Problem with Fixed Charges," Networks 19, 291-312.
19. Kruskal, J.B., Jr. (1956). "On the Shortest Spanning Tree of a Graph and the Travelling Salesman Problem," Proc. Amer. Math. Society 7, 48-50.
20. Luna, H.P.L., N. Ziviani, and R.M.B. Cabral. (1987). "The Telephonic Switching Centre Network Problem: Formalization and Computational Experience," Discrete Applied Mathematics 18, 199-210.
21. Maculan, N. (1987). "The Steiner Problem in Graphs," Annals of Discrete Mathematics 31, 185-212.
22. Magnanti, T.L., P. Mirchandani, and R. Vachani. (1993). "The Convex Hull of Two Core Capacitated Network Design Problems," Mathematical Programming 60, 233-250.
23. Mateus, G.R., F.R.B. Cruz, and H.P.L. Luna. (1994). "Algorithm for Hierarchical Network Design," Location Science 2, 149-164.
24. Mateus, G.R. and H.P.L. Luna. (1992). "Decentralized Decision-Making and Capacitated Facility Location," The Annals of Regional Science 26, 361-377.
25. Minoux, M. (1989). "Network Synthesis and Optimum Network Design Problems: Models, Solution Methods and Applications," Networks 19, 313-360.
26. Mirzaian, A. (1985). "Lagrangian Relaxation for the Star-Star Concentrator Location Problem: Approximation Algorithm and Bounds," Networks 15, 1-20.
27. Sá, G. (1969). "Branch-and-Bound and Approximate Solutions to the Capacitated Plant Location Problem," Operations Research 17, 1005-1016.
28. Wong, R.T. (1984). "A Dual Ascent Algorithm for the Steiner Problem in Directed Graphs," Mathematical Programming 28, 271-287.