Reactive tabu search with path-relinking for the steiner problem in graphs

Operations Research/ Computer Science Interfaces Series

Volumn 15, Issue , 2002, Pages 39-58

  Bastos, Marcelo P ^a   Ribeiro, Celso C ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84888790406     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4615-1507-4     Document Type: Article

References (32)

1. R. Battiti and G. Tecchiolli. The Reactive Tabu Search. ORSA Journalon Computing, 6:126-140, 1994.
2. J.E. Beasley. OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operational Research Society, 41:1069-1072, 1990.
3. S.A. Canuto, M.G.C. Resende, and C.C. Ribeiro. Local Search with Perturbationsfor the Prize-Collecting Steiner Tree Problem. To appear in: Networks.
4. E.-A. Choukmane. Une heuristique pour Ie probleme de l'arbre de Steiner. RAIRO Recherche Operationnelle, 12:207-212, 1978.
5. V.-D. Cung, S.L. Martins, C.C. Ribeiro, and C. Roucairol. Parallel Strategiesfor the Implementation of Metaheuristics. In: Essays and Surveys inMetaheuristics, C.C. Ribeiro and P. Hansen, editors, Kluwer, 2001 (thisvolume).
6. K.A. Dowsland. Hill-Climbing, Simulated Annealing and the Steiner Problemin Graphs. Engineering Optimization, 17:91-107,1991.
7. C.W. Duin. Steiner's Problem in Graphs: Approximation, Reduction, Variation. Doctorate Dissertation, Institute of Actuarial Science and Economics,University of Amsterdam, 1994.
8. C.W. Duin and S. Voss. Efficient Path and Vertex Exchange in SteinerTree Algorithms. Networks, 29:89-105, 1997.
9. H. Esbensen. Computing Near-Optimal Solutions to the Steiner Problemin a Graph Using a Genetic Algorithm. Networks, 26:173-185, 1995.
10. M. Gendreau, J.-F. Larochelle, and B. Sanso. A Tabu Search Heuristic forthe Steiner Tree Problem. Networks, 34:163-172, 1999.
11. F. Glover. Tabu Search - Part I. ORSA Journal on Computing, 1:190-206, 1989.
12. F. Glover. Tabu Search - Part II. ORSA Journal on Computing, 2:4-32,1990.
13. F. Glover. Tabu Search and Adaptive Memory Programing - Advances,Applications and Challenges. In: Interfaces in Computer Science and OperationsResearch, R.S. Barr, R.V. Helgason, and J.L. Kennington, editors, page 75, Kluwer, 1996.
14. F. Glover and M. Laguna. Tabu Search, Kluwer, 1997.
15. F.K. Hwang, D.S. Richards, and P. Winter. The Steiner Tree Problem. North-Holland, 1992.
16. RM. Karp. Reducibility Among Combinatorial Problems. In: Complexityof Computer Computations, E. Miller and J.W. Thatcher, editors, pages 85-103, Plenum Press, 1972.
17. A. Kapsalis, V.J. Rayward-Smith, and G.D. Smith. Solving the GraphicalSteiner Tree Problem Using Genetic Algorithms. Journal of the OperationalResearch Society, 44:397-406, 1993.
18. T. Koch and A. Martin. Solving Steiner Tree Problems in Graphs to Optimality. Networks, 32:207-232, 1998.
19. L.T. Kou, G. Markowsky, and L. Berman. A Fast Algorithm for SteinerTrees. Acta Informatica, 15:141-145, 1981.
20. N. Maculan. The Steiner Problem in Graphs. In: Surveys in CombinatorialOptimization, S. Martello, G. Laporte, M. Minoux, and C.C. Ribeiro,editors, Annals of Discrete Mathematics, 31:185-212, 1987.
21. S.L. Martins, C.C. Ribeiro, and M.C. Souza. A Parallel GRASP for theSteiner Problem in Graphs. Lecture Notes in Computer Science, 1457:285-297, 1998.
22. S.L. Martins, P. Pardalos, M.G. Resende, and C.C. Ribeiro. Greedy RandomizedAdaptive Search Procedures for the Steiner Problem in Graphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science,43:133-146, 1999.
23. S.L. Martins, P. Pardalos, M.G. Resende, and C.C. Ribeiro. A ParallelGRASP for the Steiner Tree Problem in Graphs Using a Hybrid LocalSearch Strategy. Journal of Global Optimization, 17:267-283, 2000.
24. Message Passing Interface Forum. MPI: A Message Passing Interface Standard,1995.
25. M. Minoux. Efficient Greedy Heuristics for Steiner Tree Problems UsingReoptimization and Supermodularity. INFOR, 28:221-233, 1990.
26. C.C. Ribeiro and M.C. Souza. Tabu Search for the Steiner Problem inGraphs. Networks, 36:138-146,2000.
27. L. Schrage. A More Portable Fortran Random Number Generator. ACMTransactions on Mathematical Software, 5:132-138, 1979.
28. H. Takahashi and A. Matsuyama. An Approximate Solution for the SteinerProblem in Graphs. Mathematica Japonica, 24:573-577,1980.
29. M.G.A. Verhoeven and E.H.L. Aarts. Parallel Local Search. Journal ofHeuristics, 1:43-65, 1995.
30. S. Voss. Steiner-Probleme in Graphen. Anton Hain, 1990.
31. S. Voss. Steiner's Problem in Graphs: Heuristic Methods. Discrete AppliedMathematics, 40:45-72, 1992.
32. P. Winter. Steiner Problem in Networks: A Survey. Networks, 17:129-167,1987.