Using generalized capacitated trees for designing the topology of local access networks

Telecommunication Systems

Volumn 7, Issue 4, 1997, Pages 315-337

  Gouveia, Luis ^a   Lopes, Maria João ^b  

^a UNIVERSITY OF LISBON   (Portugal)

^b INSTITUTO UNIVERSITÁRIO DE LISBOA ISCTE IUL   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21744455359     PISSN: 10184864     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1019184615054     Document Type: Article

References (24)

1. K. Altinkemer, Parallel savings heuristics for designing multicenter tree networks, Technical Report (1989).
2. A. Amberg, W. Domschke and S. Voß, Capacitated minimum spanning trees: algorithms using intelligent search, Technical Report, Technische Universität Braunschweig (1995).
3. J. Coimbra and L. Gouveia, Lower bounding and upper bounding methods for a K-cardinality minimal tree problem, paper presented at the 3rd INFORMS Telecommunications Conference, Boca Raton (March 1995).
4. L. Esau and K. Williams, On teleprocessing system design, Part II: A method for approximating the optimal network, IBM Syst. J. 5 (1966) 142-147.
5. B. Gavish, Formulations and algorithms for the capacitated minimal directed tree problem, J. Assoc. Comput. Mach. 30(1) (1983) 118-132.
6. B. Gavish, Augmented Lagrangian based algorithms for centralized network design, IEEE Trans. Commun. 33 (1985) 1247-1257.
7. B. Gavish, Topological design of telecommunication networks - survey of local access network design methods, Ann. Oper. Res. 33 (1991) 17-71.
8. B. Gavish and K. Altinkemer, Parallel savings heuristics for the topological design of local access tree networks, in: Proceedings of IEEE INFOCOM '86 Conference (1986).
9. L. Gouveia, A comparison of directed formulations for the capacitated minimal spanning tree problem, Telecommunications Systems 1 (1993) 51-76.
10. L. Gouveia, A 2n-constraint formulation for the capacitated minimal spanning tree problem, Oper. Res. 43 (1995) 130-141.
11. L. Gouveia and P. Martins, An extended flow based formulation for the capacitated minimal spanning tree problem, paper presented at the 3rd INFORMS Telecommunications Conference, Boca Raton (March 1995).
12. L. Gouveia and J. Paixão, Dynamic programming based heuristics for the topological design of local access networks, Ann. Oper. Res. 33 (1991) 305-327.
13. L. Hall, Integer programming formulations for designing a centralized processing network, Technical Report, Department of Mathematical Sciences, Johns Hopkins University (1993).
14. L. Hall, Experience with a cutting plane approach for the capacitated spanning tree problem, INFORMS J. Computing 8 (1996) 219-234.
15. M. Karnaugh, A new class of algorithms for multipoint network optimization, IEEE Trans. Commun. 24(5) (1976) 500-505.
16. A. Kershenbaum, R. Boorstyn and R. Oppenheim, Second-order greedy algorithms for centralized network design, IEEE Trans. Commun. 28(10) (1980) 1835-1838.
17. M.J. Lopes, Árvore de suporte de custo mínimo com restrições de capacidade em dois níveis, Master Thesis, Faculdade de Ciências da Universidade de Lisboa (January 1993).
18. T. Magnanti and L. Wolsey, Optimal trees, in: Network Models, Handbooks in Operations Research and Management Science 7 (1995) pp. 503-615.
19. J. Paixão and L. Gouveia, Métodos de investigação operacional na idealização topológica de redes centralizadas, in: Actas do 4° Congresso Português de Informática, Vol. 2b (1986) pp. 1625-1655.
20. C. Papadimitriou, The complexity of the capacitated tree problem, Networks 8 (1978) 217-230.
21. Y. Sharaiha, M. Gendreau, G. Laporte and I. Osman, A Tabu Search algorithm for the capacitated shortest spanning tree problem, Technical Report CRT-95-79, C.R.T., Université de Montreal (1995).
22. A. Tanenbaum, Computer Networks (Prentice-Hall, Englewood Cliffs, NJ, 1977).
23. S. Voß, Steiner-Probleme in Graphen, Mathematical Systems in Economics 120 (Anton Hain Verlag, 1990).
24. R. Wong, A dual ascent approach to Steiner tree problems on a directed graph, Math. Programming 28 (1984) 271-287.