The Multilevel Capacitated Minimum Spanning Tree Problem

References

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