A Comparison of Optimal Methods for Local Access Uncapacitated Network Design

Annals of Operations Research

Volumn 106, Issue 1-4, 2001, Pages 263-286

  Randazzo, C D ^a   Luna, H P L ^a  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

Author keywords

Benders decomposition; Branch and bound; Branch and cut; Network design

Indexed keywords

EID: 0035563871     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/A:1014569927266     Document Type: Article

References (54)

1. Y.P. Aneja, An integer linear programming approach to Steiner problem in graphs, Networks 10 (1980) 167-178.
2. A. Balakrishnan and K. Altinkemer, Using a hop-constrained model to generate alternative communication network design, ORSA Journal on Computing 4 (1992) 192-205.
3. F. Barahona, Network design using cut inequalities, Technical Report P.O. 218, IBM T.J. Watson Research Center, New York (1995).
4. J.E. Beasley, An sst-based algorithm for the Steiner problem in graphs, Networks 19 (1989) 1-16.
5. J.F. Benders, Partitioning procedures for solving mixed integer variables programming problems, Numerische Mathematik 4 (1962) 238-252.
6. R.R. Boorstyn and H. Frank, Large-scale network topological optimization, IEEE Transactions on Communications COM-25 (1977) 29-47.
7. M. Chandy and K.M. Rusell, The design of multipoint linkages in a teleprocessing tree network, IEEE Transactions on Communications COM-21 (1972) 1062-1066.
8. D.C. Cho, E.L. Johnson, M. Padberg and M.R. Rao, On the uncapacitated plant location problem, I: Valid inequalities and facets, Mathematics of Operations Research 8 (1983) 579-589.
9. D.C. Cho, M. Padberg and M.R. Rao, On the uncapacitated plant location problem, II: Facets and lifting theorems, Mathematics of Operations Research 8 (1983) 590-612.
10. N. Christofides and J.E. Beasley, A tree search algorithm for p-median problem, European Journal of Operational Research 10 (1982) 196-204.
11. A. Claus and N. Maculan, Une nouvelle formulation du probème de Steiner sur un graphe, Technical Report 280, Centre de Recherche sur les Transports, Université de Montréal, Canada (1983).
12. F.R.B. Cruz, J. MacGregor Smith and G.R. Mateus, Solving to optimality the uncapacitated fixed-charge network flow problem, Computers Operations Research 25 (1998) 67-81.
13. G. Dantzig, Linear Programming and Extensions (Princeton University Press, 1962).
14. C.W. Duin and A. Volgenant, Reduction tests for the Steiner problem in graphs, Networks 19 (1989) 549-567.
15. M.L. Fisher, The Lagrangian relaxation method for solving integer programming problems, Management Science 27 (1981) 1-18.
16. M.L. Fisher, An application oriented guide to Lagrangian relaxation, Interfaces 15 (1985) 10-21.
17. B. Gavish, Topological design of centralized computer networks - formulations and algorithms, Networks 12 (1982) 355-377.
18. B. Gavish, Formulations and algorithms for the capacitated minimal directed tree, Journal of the ACM 30 (1983) 118-132.
19. B. Gavish, Augmented Lagrangian based algorithms for centralized network design, IEEE Transactions on Communications COM-33 (1985) 1247-1257.
20. B. Gavish, Topological design of telecommunication networks - Local access design methods, Annals of Operations Research 33 (1991) 17-71.
21. A.M. Geoffrion and G.W. Graves, Multicomodity distribution system design by Benders decomposition, Management Science 20 (1974) 822-844.
22. A.M. Geoffrion and R.E. Marsten, Integer programming algorithms: A framework and state-of-the-art survey, Management Science 18(9) (1972) 465-491.
23. M.X. Goemans and Y. Myung, A catalog of Steiner tree formulations, Networks 23 (1993) 19-28.
24. M.C. Goldstein, Design of long-distance telecommunication networks - the Telepak problem, IEEE Transactions on Circuit Theory CT-20 (1973) 186-192.
25. R.E. Gomory, Outline of an algorithm for integer solutions to linear programs, Bulletin of the American Mathematical Society 64 (1958) 275-278.
26. L. Gouveia, A comparison of directed formulations for the capacitated minimal spanning tree problem, Telecommunication Systems 1 (1993) 51-76.
27. L. Gouveia and E. Janssen, Designing reliable tree networks with two cable technologies, European Journal of Operational Research 105 (1998) 552-568.
28. M. Grötschel, M. Jünger and G. Reinelt, A cutting plane algorithm for the linear ordering problem, Operations Research 32 (1984) 1195-1220.
29. M. Held and R.M. Karp, The traveling salesman problem and minimum spanning trees, Operations Research 18 (1970) 1138-1162.
30. M. Held and R.M. Karp, The traveling salesman problem and minimum spanning trees, Part II, Mathematical Programming 1 (1971) 6-25.
31. J. Hellstrand, T. Larsson and A. Migdalas, A characterization of the uncapacitated network design polytope, Operations Research Letters 12 (1992) 159-163.
32. D.S. Hochbaum and A. Segev, Analysis of a flow problem with fixed charges, Networks 19 (1989) 291-312.
33. K. Holmberg and J. Hellstrand, Solving the uncapacitated network design problem by a Lagrangian heuristic and branch-and-bound, Operations Research 46 (1998) 247-259.
34. F.K. Hwang and D.S. Richards, Steiner tree problems, Networks 22 (1992) 55-89.
35. F.K. Hwang, D.S. Richards and P. Winter, The Steiner Tree Problem (North-Holland, 1992).
36. T. Koch and A. Martin, Solving Steiner tree problems in graphs to optimality, Networks 32 (1998) 207-232.
37. A. Lucena and J.E. Beasley, A branch and cut algorithm for the Steiner problem in graphs, Networks 31 (1998) 39-59.
38. H.P.L. Luna, N. Ziviani and R.M.B. Cabral, The telephonic switching centre network problem: Formalization and computational experience, Discrete Applied Mathematics 18 (1987) 199-210.
39. N. Maculan, The Steiner problem in graphs, Annals of Discrete Mathematics 31 (1987) 185-212.
40. N. Maculan, D. Arpin and S. Nguyen, Le problème de Steiner sur un graphe orienté: Formulations et relaxations, Matemática Aplicada e Computacional 7 (1988) 109-118.
41. N. Maculan, P. Souza and A.C. Vejar, An approach for the Steiner problem in directed graphs, Annals of Operations Research 33 (1991) 471-480.
42. T.L. Magnanti, P. Mirchandani and R.T. Wong, Tailoring Benders decomposition for uncapacitated network design, Mathematical Programming Study 26 (1986) 112-154.
43. T.L. Magnanti and R.T. Wong, Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria, Operations Research 29(3) (1981) 464-483.
44. G.R. Mateus, Algoritmo Exato e Heurísticas para o Problema de Localização, Ph.D. thesis, COPPE/UFRJ, COPPE/UFRJ, Rio de Janeiro, RJ (1986).
45. G.R. Mateus, H.P.L. Luna and A.B. Sirihal, Heuristics for distribution network design in telecommunication, Journal of Heuristics 6 (2000) 131-148.
46. K. Mehlhorn, A faster approximation algorithm for the Steiner problem in graphs, Information Processing Letters 27 (1988) 125-128.
47. M.W. Padberg and G. Rinaldi, Optimization of a 532-city symmetric travelling salesman polytope by branch and cut, Operations Research Letters 6 (1987) 1-7.
48. C.D. Randazzo, Algoritmo branch-and-bound paralelo para o problema de planejamento de redes de acesso local, Master's thesis, Department of Computer Science, Federal University of Minas Gerais, Belo Horizonte, Brazil (1997).
49. R.L. Rardin and L.A. Wolsey, Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems, European Journal of Operational Research 71 (1993) 95-109.
50. C.R. Reeves, Modern Heuristic Techniques for Combinatorial Problems (Blackwell, Londres, UK, 1993).
51. B. Rothfarb and M.C. Goldstein, The one-terminal Telepak problem, Operations Research 19 (1971) 156-169.
52. A.G. Santos, Algoritmos baseados em planos de corte para o problema de planejamento de redes de acesso, Master's thesis, Department of Computer Science, Federal University of Minas Gerais, Belo Horizonte, Brazil (1998).
53. P. Winter, Steiner problem in networks, Networks 17 (1987) 129-167.
54. R.T. Wong, A dual ascent algorithm for the steiner problem in directed graphs, Mathematical Programming 28 (1984) 271-287.