Enhanced second order algorithm applied to the capacitated minimum spanning tree problem

Computers and Operations Research

Volumn 34, Issue 8, 2007, Pages 2495-2519

  Martins, Pedro ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

Capacitated minimum spanning tree problem; Metaheuristics; Repetitive methods; Second order algorithms

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; TREES (MATHEMATICS);

CAPACITATED MINIMUM SPANNING TREE PROBLEM; METAHEURISTICS; REPETITIVE METHODS; SECOND ORDER ALGORITHMS;

ALGORITHMS;

EID: 33846074420     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.09.017     Document Type: Article

References (29)

1. Papadimitriou C. The complexity of the capacitated tree problem. Networks 8 (1978) 217-230
2. Hall L. Experience with a cutting plane approach for the capacitated spanning tree problem. INFORMS Journal on Computing 8 (1996) 219-234
3. Fukasawa R., Poggi de Aragão M., Porto O., and Uchoa E. Robust branch-and-cut-and-price for the capacitated minimum spanning tree problem. Proceedings of the international network optimization conference. Evry, France (2003) 231-236
4. Gouveia L., and Martins P. The capacitated minimum spanning tree problem: revisiting hop-indexed formulations. Computers & Operations Research 32 (2005) 2435-2452
5. Karnaugh M. A new class of algorithms for multipoint network optimization. IEEE Transactions on Communications COM-24 (1976) 500-505
6. Duin C., and Voß S. The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs. Networks 34 (1999) 181-191
7. Voß S., Fink A., and Duin C. Looking ahead with the pilot method. Annals of Operations Research 136 (2005) 285-302
8. Kershenbaum A., Boorstyn R., and Oppenheim R. Second-order greedy algorithms for centralized teleprocessing network design. IEEE Transactions on Communications COM-28 (1980) 1835-1838
9. Patterson R., Rolland E., and Pirkul H. A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem. Journal of Heuristics 5 (1999) 159-180
10. Amberg A., Domschke W., and Voß S. Capacitated minimum spanning trees: algorithms using intelligent search. Combinatorial Optimization: Theory and Practice 1 (1996) 9-40
11. Sharaiha Y., Gendreau M., Laporte G., and Osman I. A tabu search algorithm for the capacitated shortest spanning tree problem. Networks 29 (1997) 161-171
12. Ahuja R., Orlin J., and Sharma D. Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Mathematical Programming 91 (2001) 71-97
13. Ahuja R., Orlin J., and Sharma D. A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. Operations Research Letters 31 (2003) 185-194
14. Esau L.R., and Williams K.C. On teleprocessing system design. IBM Systems Journal 5 (1966) 142-147
15. Prim R. Shortest connection networks and some generalization. Bell System Technical Journal 36 (1957) 1389-1401
16. deSouza M., Duhamel C., and Ribeiro C. A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy. In: Resende M., and Souza J. (Eds). Metaheuristics: computer decision-making (2003), Kluwer Academic Publishers, Boston 627-657
17. Reimann M, Laumanns M. Savings based ant colony optimization for the capacitated shortest spanning tree problem. Computers & Operations Research 2006;33:1794-822 .
18. Amberg A, Gouveia L, Martins P, Voß S. Iterative heuristic metastrategies. Fifth INFORMS telecommunications conference. Boca Raton, FL, USA; 2000.
19. Gavish B, Altinkemer K. A parallel savings heuristic for the topological design of local access tree networks. In: Proceedings of the IEEE INFOCOM 86 conference; 1986. p. 130-9.
20. Jarvis J., and Whited D. Computational experience with minimum spanning tree algorithms. Operations Research Letters 2 1 (1983) 36-41
21. Bazlamaçci C., and Hindi K. Minimum weight spanning tree algorithms: a survey and empirical study. Computers & Operations Research 28 (2001) 767-785
22. Ahuja R., Magnanti T., and Orlin J. Network flows: theory, algorithms and applications (1993), Prentice-Hall, New Jersey
23. Kershenbaum A. Computing minimum spanning trees efficiently. Networks 4 (1974) 299-310
24. Chandy K., and Lo T. The capacitated minimum spanning tree. Networks 3 (1973) 173-181
25. Gouveia L., and Martins P. A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem. Networks 35 1 (2000) 1-16
26. Uchoa E. Personal communication; 2005.
27. Sharma D. Personal communication; 2003.
28. Martins P. Problema da Árvore de Suporte de Custo Mínimo com Restrição de Capacidade: Formulações com Índice de Nível. PhD dissertation, Faculty of Science, University of Lisbon; 2000 [in Portuguese].
29. Kruskal J. On the shortest spanning subtree of a graph and the travelling salesman problem. Proceedings of the American Mathematical Society 7 (1956) 48-50