Author:
Rego Cesar,Mathew Frank,Glover Fred
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference33 articles.
1. Ahuja, R. K., Orlin, J. B., & Sharma, D. (2001). Multi-exchange neighborhood search structures for the capacitated minimum spanning tree problem. Mathematical Programming, 91, 71–97.
2. Ahuja, R. K., Orlin, J. B., & Sharma, D. (2003). A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. Operations Research Letters, 31, 185–194.
3. Amberg, A., Domschke, W., & Voß, S. (1996). Capacitated minimum spanning trees: algorithms using intelligent search. Combinatorial Optimization: Theory and Practice, 1, 9–39.
4. Caserta, M. (2007). Tabu search-based metaheuristic algorithm for large-scale set covering problems. In K. F. Doerner, M. Gendreau, P. Greistorfer, W. J. Gutjar, R. F. Hartl, & M. Reimann (Eds.), Metaheuristics: progress in complex systems optimization (pp. 43–63). Berlin: Springer.
5. Elias, D., & Ferguson, M. J. (1974). Topological design of multipoint teleprocessing networks. IEEE Transactions on Communications, 22, 1753–1762.
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献