Tabu search for the Steiner problem in graphs

Networks

Volumn 36, Issue 2, 2000, Pages 138-146

  Ribeiro, Celso C ^a   De Souza, Mauricio C ^a  

^a PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Combinatorial optimization; Graphs; Local search; Metaheuristics; Steiner problem; Tabu search

Indexed keywords

EID: 0034259693     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0037(200009)36:2<138::AID-NET9>3.0.CO;2-U     Document Type: Article

References (30)

1. [1] R. Barr, F. Glover, and D. Klingman, Enhancements of spanning tree labelling procedures for network optimization, INFOR 17 (1979), 16-34.
2. [2] J.E. Beasley, OR-Library: Distributing test problems by electronic mail, J Oper Res Soc 41 (1990), 1069-1072.
3. [3] E.-A. Choukmane, Une heuristique pour le problème de l'arbre de Steiner, KAIRO Rech Oper 12 (1978), 207-212.
4. [4] K.A. Dowsland, Hill-climbing, simulated annealing and the Steiner problem in graphs, Eng Optim 17 (1991), 91-107.
5. [5] C.W. Duin, Steiner's problem in graphs: Approximation, reduction, variation. Doctorate Dissertation, Institute of Actuarial Science and Economics, University of Amsterdam, 1994.
6. [6] C.W. Duin and S. Voss, "Steiner tree heuristics - A survey," Operations research proceedings 1993, H. Dyckhoff, U. Derigs, M. Salomon, and H.C. Tijms (Editors), Springer-Verlag, Berlin, 1994, pp. 485-496.
7. [7] C.W. Duin and S. Voss, Efficient path and vertex exchange in Steiner tree algorithms. Networks 29 (1997), 89-105.
8. [8] H. Esbensen, Computing near-optimal solutions to the Steiner problem in a graph using a genetic algorithm, Networks 26 (1995), 173-185.
9. [9] M. Gendreau, J.-F. Larochelle, and B. Sansó, A tabu search heuristic for the Steiner tree problem, Les Cahiers du GERAD G-98-01, Montréal, 1998.
10. [10] F.K. Hwang, D.S. Richards, and P. Winter, The Steiner tree problem, North-Holland, Amsterdam, 1992.
11. [11] A. Kapsalis, V.J. Ray ward-Smith, and G.D. Smith, Solving the graphical Steiner tree problem using genetic algorithms, J Oper Res Soc 44 (1993), 397-406.
12. [12] R.M. Karp, Reducibility among combinatorial problems, Complexity of computer computations, E. Miller and J.W. Thatcher (Editors), Plenum Press, New York, 1972, pp. 85-103.
13. [13] L.T. Kou, G. Markowsky, and L. Berman, A fast algorithm for Steiner trees, Acta Inf 15 (1981), 141-145.
14. [14] N. Maculan, The Steiner problem in graphs, Surveys in combinatorial optimization, S. Martello, G. Laporte, M. Minoux, and C.C. Ribeiro (Editors), Ann Discr Math 31 (1987), 185-212.
15. [15] S.L. Martins, C.C. Ribeiro, and M.C. Souza, A parallel GRASP for the Steiner problem in graphs, Lecture Notes in Computer Science 1457 (1998), 285-297.
16. [16] S.L. Martins, P. Pardalos, M.G. Resende, and C.C. Ribeiro, Greedy randomized adaptive search procedures for the Steiner problem in graphs, DIMACS Ser Discr Math Theor Comput Sci 43 (1999), 133-146.
17. [17] M. Minoux, Efficient greedy heuristics for Steiner tree problems using reoptimization and supermodularity, INFOR 28 (1990), 221-233.
18. [18] J. Plesník, A bound for the Steiner problem in graphs, Math Slov 31 (1981), 155-163.
19. [19] R.C. Prim, Shortest connection networks and some generalisations, Bell Syst Tech J 36 (1957), 1389-1401.
20. [20] V.J. Rayward-Smith and A. Clare, On finding Steiner vertices, Networks 16 (1986), 283-294.
21. [21] P.M. Spira and A. Pan, On finding and updating spanning trees and shortest paths, SIAM J Compu 4 (1975), 375-380.
22. [22] H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Math Jap 24 (1980), 573-577.
23. [23] M.G.A. Verhoeven, M.E.M. Severens, and E.H. Aarts, "Local search for Steiner trees in graphs," Modern Heuristic Search Methods, V.J. Rayward-Smith, I.H. Osmam, C.R. Reeves, and G.D. Smith (Editors), Wiley, New York, 1996, pp. 117-129.
24. [24] S. Voss, Steiner-Probleme in Graphen, Anton Hain, Frankfurt, 1990.
25. [25] S. Voss, Steiner's problem in graphs: Heuristic methods, Discr Appl Math 40 (1992), 45-72.
26. [26] S. Voss and K. Gutenschwager, A chunking based genetic algorithm for the Steiner tree problem in graphs (to appear).
27. [27] P. Winter, Steiner problem in networks: A survey, Networks 17 (1987), 129-167.
28. [28] P. Winter and J. MacGregor Smith, Path-distance heuristics for the Steiner problem in undirected networks, Alg 7 (1992), 309-327.
29. [29] J. Xu, S. Y. Chiu, and F. Glover, Probabilistic tabu search for telecommunications network design, Combin Optim Theory Pract 1 (1997), 69-94.
30. [30] J. Xu, S. Y. Chiu, and F. Glover, Using tabu search to solve the Steiner tree-star problem in telecommunications network design, Telecommun Syst 6 (1996), 117-125.