The pilot method: A strategy for heuristic repetition with application to the steiner problem in graphs

Networks

Volumn 34, Issue 3, 1999, Pages 181-191

  Duin, Cees ^a   Voß, Stefan ^b  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033209567     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y     Document Type: Article

References (19)

1. [1] E.W. Dijkstra, A note on two problems in connexion with graphs, Num Math 1 (1959), 269-271.
2. [2] K. A. Dowsland, Hill-climbing, simulated annealing and the Steiner problem in graphs, Eng Optim 17 (1991), 91-107.
3. [3] C.W. Duin, Steiner's problem in graphs, PhD Thesis, University of Amsterdam, 1994.
4. [4] C.W. Duin and S. Voß, "Steiner tree heuristics - A survey," Operations Research Proc 1993 (DGOR-NSOR), H. Dyckhoff, U. Derigs, M. Salomon, and H.C. Tijms (Editors), Springer, Berlin, 1994, pp. 485-496.
5. [5] C.W. Duin and S. Voß, Efficient path and vertex exchange in Steiner tree algorithms, Networks 29 (1997), 89-105.
6. [6] H. Esbensen, Computing near-optimal solutions to the Steiner problem in graphs using a genetic algorithm, Networks 26 (1995), 173-216.
7. [7] M.R. Garey and D.S. Johnson, The rectilinear Steiner tree problem is NP-complete, SIAM J Appl Math 32 (1977), 826-834.
8. [8] F.K. Hwang, D.S. Richards, and P. Winter, The Steiner tree problem, Ann Discr Math 53 (1992).
9. [9] A. Kapsalis, V.J. Rayward-Smith, and G.D. Smith, Solving the graphical Steiner tree problem using genetic algorithms, J Oper Res Soc 44 (1993), 397-406.
10. [10] L. Kou, G. Markowsky, and L. Berman, A fast algorithm for Steiner trees, Acta Inf 15 (1981), 141-145.
11. [11] E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan (Editors), The traveling salesman problem: A guided tour of combinatorial optimization, Wiley, New York, 1986.
12. [12] K. Mehlhorn, A faster approximation algorithm for the Steiner problem in graphs, Inf Process Lett 27 (1988), 125-128.
13. [13] M. Minoux, Efficient greedy heuristics for Steiner tree problems using reoptimization and supermodularity, IN-FOR 28 (1990), 221-233.
14. [14] J. Pearl, Heuristics, Addison-Wesley, Reading, MA, 1984.
15. [15] R.C. Prim, Shortest connection networks and some generalizations, Bell Syst Tech J 36 (1957), 1389-1401.
16. [16] V.J. Rayward-Smith and A. Clare, On finding Steiner vertices, Networks 16 (1986), 283-294.
17. [17] H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Math Jpn 24 (1980), 573-577.
18. [18] P. Winter and J. MacGregor Smith, Path-distance heuristics for the Steiner problem in undirected networks, Algorithmica 7 (1992), 309-327.
19. [19] A.Z. Zelikovsky, "An 11/6 approximation algorithm for the Steiner problem in graphs," Fourth Symp on Combinatorics, Graphs and Complexity, J. Nesetril and M. Fiedler (Editors), Elsevier, Amsterdam, 1992, pp. 351-354.