Local search for the Steiner tree problem in the Euclidean plane

European Journal of Operational Research

Volumn 119, Issue 2, 1999, Pages 282-300

  Zachariasen, Martin ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; POLYNOMIALS; TREES (MATHEMATICS);

EUCLIDIAN STEINER TREE PROBLEM; LOCAL SEARCH HEURISTICS; MINIMUM SPANNING TREE;

PROBLEM SOLVING;

EID: 0033333858     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00131-9     Document Type: Article

References (46)

1. E.H.L. Aarts, J.K. Lenstra (Eds.), Local Search in Combinatorial Optimization, Wiley, New York, 1997.
2. A. Armillotta, G. Mummolo, A heuristic algorithm for the Steiner problem with obstacles. Technical report, Dipt. di Pregettazione e Produzione Industriale, Univ. degli Studi di Bari, Bari, 1988.
3. S. Arora, Polynomial time approximation schemes for Euclidean TSP and other geometric problems, in: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996, p. 2-13.
4. Beasley J.E. OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society. 41:1990;1069-1072.
5. Beasley J.E. A heuristic for Euclidean and rectilinear Steiner problems. European Journal of Operational Research. 58:1992;284-292.
6. Beasley J.E., Goffinet F. A delaunay triangulation-based heuristic for the Euclidean Steiner problem. Networks. 24:1994;215-224.
7. Berman P., Ramaiyer V. Improved approximations for the Steiner tree problem. Journal of Algorithms. 17(3):1994;381-408.
8. Chang S.K. The generation of minimal trees with a Steiner topology. J. ACM. 19:1972;699-711.
9. Chapeau-Blondeau F., Janez F., Ferrier J.-L. A dynamic adaptive relaxation scheme applied to the Euclidean Steiner minimal tree problem. SIAM Journal on Optimization. 7(4):1997;1037-1053.
10. Chung F.R.K., Graham R.L. Steiner trees for ladders. Annals of Discrete Mathematics. 2:1978;173-200.
11. D.R. Dreyer, M.L. Overton, Two heuristics for the Steiner tree problem, Technical Report 724, Computer Science Department, New York University, 1996.
12. Du D.-Z., Zhang Y. On better heuristics for Steiner minimum trees. Mathematical Programming. 57:1992;193-202.
13. Gilbert E.N., Pollak H.O. Steiner minimal trees. SIAM Journal on Applied Mathematics. 16(1):1968;1-29.
14. G.R. Grimwood, The Euclidean Steiner Tree Problem: Simulated Annealing and Other Heuristics. Master's thesis, Institute of Statistics and Operations Research, Victoria University of Wellington, New Zealand, 1994.
15. J. Hesser, R. Männer, O. Stucky. Optimization of Steiner trees using genetic algorithms, in: Proceedings of the Third International Conference on Genetic Algorithm, 1989, p. 231-236.
16. T. Hürlimann, The Euclidean Steiner tree problem, implementation of a heuristic, Technical Report 94-14, Institute of Informatics, University of Fribourg, 1994.
17. Hwang F.K. A linear time algorithm for full Steiner trees. Operations Research Letters. 4(5):1986;235-237.
18. F.K. Hwang, D.S. Richards, P. Winter, The Steiner Tree Problem, Annals of Discrete Mathematics 53, Elsevier, Amsterdam, 1992.
19. Hwang F.K., Weng J.F. The shortest network under a given topology. Journal of Algorithms. 13:1992;468-488.
20. Jayadeva, Bhaumik B. A neural network for the Steiner minimal tree problem. Biological Cybernetics. 70:1994;485-494.
21. Johnson D.S., Aragon C.R., McGeoch L.A., Schevon C. Optimization by simulated annealing: An experimental evaluation; Part I, graph partitioning. Operations Research. 37(6):1989;865-892.
22. Karp R. Probabilistic analysis of partitioning algorithms for the traveling salesman problem in the plane. Mathematics of Operations Research. 2:1977;209-224.
23. P. Korhonen, An algorithm for transforming a spanning tree into a Steiner tree, in: Survey of Math. Programming, Proceedings of the Ninth International Math. Program. Symp., vol. 2, North-Holland, Amsterdam, 1974, p. 349-357.
24. Lundy M. Applications of the annealing algorithm to combinatorial problems in statistics. Biometrika. 72:1985;191-198.
25. K. Mehlhorn, S. Näher, LEDA - A Platform for Combinatorial and Geometric Computing. Max-Planck-Institut für Informatik, Saarbrücken, Germany, http://www.mpi-sb.mpg.de/LEDA/leda.html, 1996.
26. Melzak Z.A. On the problem of Steiner. Canadian Mathematical Bulletin. 4(2):1961;143-148.
27. M. Nielsen, Abstakte Voronoi-diagrammer i ESTPO-heuristikker, Master's thesis, DIKU, Department of Computer Science, University of Copenhagen, 1994.
28. F.P. Preparata, M.I. Shamos, Computational Geometry: An Introduction, 2nd ed., Springer, New York, 1988.
29. Provan J.S. An approximation scheme for finding Steiner trees with obstacles. SIAM Journal on Computing. 17(5):1988;920-934.
30. 3 Networks. 24:1994;409-415.
31. Sleator D.D., Tarjan R.E. A data structure for dynamic trees. Journal of Computer and System Sciences. 26:1983;362-391.
32. J.M. Smith, Generalized Steiner network problems in engineering design, In: Design Optimization, Academic Press, New York, 1985.
33. Smith J.M., Lee D.T., Liebman J.S. An. O(n log n) heuristic for the rectilinear Steiner minimal tree problem Engineering Optimization. 4:1980;179-192.
34. Smith J.M., Lee D.T., Liebman J.S. An. O(n log n) heuristic for Steiner minimal tree problems on the Euclidean metric Networks. 11:1981;23-29.
35. Smith J.M., Liebman J.S. Steiner trees, Steiner circuits and the interference problem in building design. Engineering Optimization. 4:1979;15-36.
36. 3 Networks. 25:1995;273-289.
37. Smith W.D. How to find Steiner minimal trees in Euclidean. d -space? Algorithmica. 7(2/3):1992;137-177.
38. Soukup J. Minimum Steiner trees, roots of a polynomial and other magic. ACM/SIGMAP Newsletter. 22:1977;37-51.
39. Soukup J., Chow W.F. Set of test problems for the minimum length connection networks. ACM/SIGMAP Newsletter. 15:1973;48-51.
40. Suzuki A., Iri M. A heuristic method for the Euclidean Steiner problem as a geometrical optimization problem. Asia-Pacific Journal of Operational Research. 3(2):1986;109-122.
41. Thompson E.A. The method of minimum evolution. Annals of Human Genetics. 36:1973;333-340.
42. Voß S. Steiner's problem in graphs: Heuristic methods. Discrete Applied Mathematics. 40:1992;45-72.
43. D.M. Warme, Personal communication, 1997.
44. Winter P., Smith J.M. Steiner minimal trees for three points with one convex polygonal obstacle. Annals of Operations Research. 33:1991;577-599.
45. Winter P., Zachariasen M. Euclidean Steiner minimum trees: An improved exact algorithm. Networks. 30:1997;149-166.
46. M. Zachariasen, P. Winter, Concatenation-based greedy heuristics for the euclidean steiner tree problem, Algorithmica (to appear).