The Capacitated Minimal Spanning Tree Problem: An experiment with a hop-indexed model

Annals of Operations Research

Volumn 86, Issue , 1999, Pages 271-294

  Gouveia, Luis ^a   Martins, Pedro ^b  

^a UNIVERSITY OF LISBON   (Portugal)

^b POLYTECHNIC INSTITUTE OF COIMBRA   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033425803     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018911003529     Document Type: Article

References (26)

1. A. Amberg, W. Domschke and S. Voss, Capacitated minimum spanning trees: Algorithms using intelligent search, Combinatorial Optimization: Theory and Practice, vol. 1, 1996, pp. 9-40.
2. G. Araque, L. Hall and T. Magnanti, Capacitated trees, capacitated routing and associated polyhedra, C.O.R.E. Discussion Paper, 1990.
3. K. Chandy and T. Lo, The capacitated minimal spanning tree problem, Networks 3(1973)173-182.
4. J. Coimbra and L. Gouveia, Lower bounding and upper bounding methods for a K-cardinality minimal tree problem, paper presented at the 3rd ORSA Telecommunications SIG Conference, Boca Raton, FL, 1995.
5. L. Esau and K. Williams, A method for approximating the optimal network, IBM Syst. Journal 5 (1966)142-147.
6. M. Fischetti and P. Toth, An additive bounding procedure for combinatorial optimization problems, Operations Research 37(1989)319-328.
7. M. Fischetti, H. Hamacher, K. Jörnsten and F. Maffioli, Weighted K-cardinality trees: Complexity and polyhedral structure, Networks 24(1994)11-21.
8. B. Gavish, Topological design of centralized computer networks: Formulations and algorithms, Networks 12(1982)355-377.
9. B. Gavish, Formulations and algorithms for the capacitated minimal directed tree problem, J. ACM 30(1983)118-132.
10. B. Gavish, Augmented Lagrangian based algorithms for centralized network design, IEEE Trans. on Comm. COM-33(1985)1247-1257.
11. B. Gavish and K. Altinkemer, Parallel savings heuristics for the topological design of local access tree networks, in: Proceedings of the IEEE INFOCOM 86 Conference, 1986.
12. L. Gouveia, A comparison of directed formulations for the capacitated minimal spanning tree problem, Telecommunications Systems and Modeling 1(1993)51-76.
13. L. Gouveia, A 2n-constraint formulation for the capacitated minimal spanning tree problem, Operations Research 43(1995)130-141.
14. a Conferência em Estatística e Investigação Operacional, Troia, Portugal 1990 (in Portuguese).
15. L. Gouveia and J. Paixão, Dynamic programming based heuristics for the topological design of local access networks, Annals of Operations Research 33(1991)305-327.
16. L. Gouveia, A. Lucena and J. Paixão, A set-partitioning approach for the capacitated minimal spanning tree problem, Paper presented at the 1st ORSA Telecommunications SIG Conference, Boca Raton, FL, 1990.
17. L. Gouveia and P. Martins, An extended flow based formulation for the capacitated minimal spanning tree problem, Paper presented at the 3rd ORSA Telecommunications SIG Conference, Boca Raton, FL, 1995.
18. L. Hall and T. Magnanti, A polyhedral intersection theorem for capacitated trees, Mathematics of Operations Research 17(1992)398-410.
19. L. Hall, Integer programming formulations for designing a centralized processing network, Working Paper, Dept. of Mathematical Sciences, Johns Hopkins University, 1993.
20. L. Hall, Experience with a cutting plane approach for the capacitated spanning tree problem, INFORMS Journal on Computing 8(1996)219-234.
21. T. Magnanti and L. Wolsey, Optimal trees, in: Network Models, Handbooks in Operations Research and Management Science, vol. 7, 1995, pp. 503-615.
22. K. Malik and G. Yu, A branch and bound algorithm for the capacitated minimum spanning tree problem, Networks 23(1993)525-532.
23. C. Papadimitriou, The complexity of the capacitated tree problem, Networks 8(1978)217-230.
24. Y. Sharaiha, M. Gendreau, G. Laporte and I. Osman, A tabu search algorithm for the capacitated shortest spanning tree problem, 1995, to appear in Networks.
25. P. Toth and D. Vigo, An exact algorithm for the capacitated shortest spanning arborescence, Annals of Operations Research 61(1995)121-141.
26. N. Zhang, Facet-defining inequalities for capacitated spanning trees, Master Thesis Dissertation, Princeton University, 1993.