RAMP for the capacitated minimum spanning tree problem

Annals of Operations Research

Volumn 181, Issue 1, 2010, Pages 661-681

  Rego, Cesar ^a   Mathew, Frank ^a   Glover, Fred ^b  

^a UNIVERSITY OF MISSISSIPPI   (United States)

^b UNIVERSITY OF COLORADO   (United States)

Author keywords

Heuristics; Minimum spanning tree; RAMP; Scatter search; Surrogate constraints; Tabu search

Indexed keywords

EID: 78649771855     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-010-0800-4     Document Type: Article

References (33)

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.
6. Esau, L. R., & Williams, K. C. (1966). On teleprocessing system design. Part II. A method for approximating the optimal network. IBM Systems Journal, 5, 142-147.
7. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman.
8. Gavish, B. (1982). Topological design of centralized computer networks: formulations and algorithms. Networks, 12, 355-377.
9. Gavish, B. (1983). Formulations and algorithms for the capacitated minimal directed spanning tree problem. Journal of ACM, 30(1), 118-132.
10. Gavish, B. (1985). Augmented Lagrangian based algorithms for centralized network design. IEEE Transactions on Communications, COM-33, 12, 1247-1257.
11. Gavish, B. (1991). Topological design telecommunications networks: local access design methods. Annals of Operations Research, 33, 17-71.
12. Glover, F. (1989a). Tabu search. Part I. ORSA Journal on Computing, 1, 190-206.
13. Glover, F. (1989b). Tabu search. Part II. ORSA Journal on Computing, 2, 4-32.
14. Glover, F. (1996). Tabu search and adaptive memory programming: advances, applications and challenges. In R. Barr, R. Helgason, & J. Kennington (Eds.), Interfaces in computer science and operations research (pp. 1-75). Norwell: Kluwer Academic.
15. Glover, F. (2005). Adaptive memory projection methods for integer programming. In C. Rego, & B. Alidaee (Eds.), Metaheuristic optimization via memory and evolution (pp. 425-440). Norwell: Kluwer Academic.
16. Glover, F., & McMillan, C. (1986). The general employee scheduling problem: an integration of management science and artificial intelligence. Computers and Operations Research, 13(4), 563-593.
17. Gouveia, L. (1995). A 2n constraint formulation for the capacitated minimal spanning tree problem. Operations Research, 43, 130-141.
18. Grünert, T. (2002). Lagrangian tabu search. In C. C. Ribeiro & P. Hansen (Eds.), Essays and surveys in metaheuristics (pp. 379-397). Norwell: Kluwer Academic.
19. Hall, L. A. (1996). Experience with a cutting plane approach for the capacitated spanning tree problem. ORSA Journal on Computing, 8, 219-234.
20. Karwan, M. H., & Rardin, R. L. (1984). Surrogate dual multiplier search procedures in integer programming. Operations Research, 32(1), 52-69.
21. Klincewicz, J. G., Luss, H., & Yan, D. C. K. (1998). Designing tributary networks with multiple ring families. Computers. Operations Research, 25(12), 1145-1157.
22. Lorena, L. A. N., & Narciso, M. G. (1999). Lagrangian/surrogate relaxation for generalized assignment problems. European Journal of Operational Research, 123, 325-332.
23. Malik, K., & Yu, G. (1993). A branch and bound algorithm for the capacitated minimum spanning tree problem. Networks, 23, 525-532.
24. Mathew, F., & Rego, C., (2006). Recent advances in heuristics for the capacitated minimum spanning tree problem. In Proceedings of the Decision Sciences Institute (DSI), San Antonio, TX (pp. 31021-31026).
25. Orús, R. (2005). Two slightly-entangled NP-complete problems. Quantum Information and Computation, 5(6), 449-455.
26. Papadimitriou, C. (1978). The complexity of the capacitated tree problem. Networks, 8, 217-230.
27. Patterson, R., Pirkul, H., & Rolland, E. (1999). Memory adaptive reasoning for solving the capacitated minimum spanning tree problem. Journal of Heuristics, 5, 159-180.
28. Polyak, B. T. (1969). Minimization of unsmooth functionals. USSR Computational Mathematics and Mathematical Physics, 9, 14-29.
29. Rego, C. (2005). RAMP: A new metaheuristic framework for combinatorial optimization. In C. Rego & B. Alidaee (Eds.), Metaheuristic optimization via memory and evolution: tabu search and scatter search (pp. 441-460). Norwell: Kluwer Academic.
30. Sharaiha, Y. M., Gendreau, M., Laporte, G., & Osman, I. H. (1997). A tabu search algorithm for the capacitated shortest spanning tree problem. Networks, 29, 161-171.
31. Uchoa, E., Fukasawa, R., Lysgaard, J., Pessoa, A., de Aragão, M. P., & Andrade, D. (2008). Robust branch-but-and-price for the capacitated minimum spanning tree problem over a large extended formulation. Mathematical Programming, Series A, 112(2), 443-472.
32. Yagiura, M., Kishida, M., & Ibaraki, T. (2006). A 3-flip neighborhood local search for the set covering problem. European Journal of Operational Research, 172, 472-499.
33. Zhang, N. (1993). Facet-defining inequalities for minimum spanning trees. Master thesis, Princeton University, Princeton, New Jersey.