The multilevel capacitated minimum spanning tree problem

INFORMS Journal on Computing

Volumn 18, Issue 3, 2006, Pages 348-365

  Gamvros, Ioannis ^a   Golden, Bruce ^a   Raghavan, S ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Genetic algorithms; Heuristics; Local search; Multiexchange neighborhood; Networks; Tree algorithms

Indexed keywords

EID: 33748553317     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1040.0123     Document Type: Article

References (21)

1. Ahuja, R. K., J. B. Orlin, D. Sharma. 2001. Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Math. Programming 91 71-97.
2. Amberg, A., W. Domschke, S. Voß. 1996. Capacitated minimum spanning trees: Algorithms using intelligent search. Combin. Optim. Theory Practice 1 9-40.
3. Berger, D., B. Gendron, J. Y. Potvin, S. Raghavan, P. Soriano. 2000. Tabu search for a network loading problem with multiple facilities. J. Heuristics 6 253-267.
4. Bienstock, D., O. Günlük. 1996. Capacitated network design-polyhedral structure and computation. INFORMS J. Comput. 8 243-259.
5. Bienstock, D., S. Chopra, O. Günlük, C.-Y. Tsai. 1998. Minimum cost capacity installation for multicommodity network flows. Math. Programming 81 177-199.
6. Dahl, G., M. Stoer. 1998. A cutting plane algorithm for multicommodity survivable network design problems. INFORMS J. Comput. 10 1-11.
7. Esau, L. R., K. C. Williams. 1966. On teleprocessing system design. IBM System J. 5 142-147.
8. Falkenauer, E. 1996. A hybrid grouping genetic algorithm for bin packing. J. Heuristics 2 5-30.
9. Gavish, B. 1982. Topological design of centralized computer networks-Formulations and algorithms. Networks 12 355-377.
10. Gavish, B. 1983. Formulations and algorithms for the capacitated minimal directed tree problem. J. ACM 30 118-132.
11. Gavish, B. 1991. Topological design of telecommunications networks-Local access design methods. Ann. Oper. Res. 33 17-71.
12. Gouveia, L. 1993. A comparison of directed formulations for the capacitated minimum spanning tree problem. Telecomm. Systems 1 51-76.
13. Magnanti, T., P. Mirchandani, R. Vachani. 1993. The convex hull of two core capacitated network desing problems. Math. Programming 60 233-250.
14. Magnanti, T., P. Mirchandani, R. Vachani. 1995. Modeling and solving the two-facility capacitated network loading problem. Oper. Res. 43 142-157.
15. McGregor, P. M., D. Shen. 1977. Network design: An algorithm for access facility location problems. IEEE Trans. Comm. 25 61-73.
16. Michalewicz, Z. 1996. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, New York.
17. Rothfarb, B., M. C. Goldstein. 1971. The one-terminal Telpak problem. Oper. Res. 19 156-169.
18. Salman, F., S. R. Ravi, J. Hooker. 2001. Solving the local access network design problem. Working paper, Krannert Graduate School of Management, Purdue University, West Lafayette, IN.
19. Sharaiha, Y. M., M. Gendreau, G. Laporte, I. H. Osman. 1997. A tabu search algorithm for the capacitated minimum spanning tree problem. Networks 29 161-171.
20. Sharma, R. L. 1983. Design of an economical multidrop network topology with capacity constraints. IEEE Trans. Comm. 31 590-591.
21. Thompson, P., J. B. Orlin. 1989. Theory of cyclic transfers. Working paper, Operations Research Center, MIT, Cambridge, MA.