A partition-based heuristic for the steiner tree problem in large graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8457 LNCS, Issue , 2014, Pages 56-70

  Leitner, Markus ^a   Ljubić, Ivana ^a   Luipersbeck, Martin ^b   Resch, Max ^b  

^a UNIVERSITY OF VIENNA   (Austria)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; HEURISTIC ALGORITHMS; HEURISTIC METHODS;

APPROXIMATE SOLUTION; EFFICIENT CONSTRUCTION; HEURISTIC SOLUTIONS; MEMETIC ALGORITHMS; NEIGHBORHOOD STRUCTURE; STEINER TREE PROBLEM; VARIABLE NEIGHBORHOOD DESCENTS; VORONOI DIAGRAMS;

FORESTRY;

ALGORITHMS; FORESTRY; PROBLEM SOLVING;

EID: 84903636886     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-07644-7_5     Document Type: Conference Paper

References (20)

1. Koch, T., Martin, A.: Solving Steiner tree problems in graphs to optimality. Networks 32(3), 207-232 (1998)
2. de Aragäo, M.P., Uchoa, E., Werneck, R.F.F.: Dual heuristics on the exact solution of large Steiner problems. Electronic Notes in Discrete Mathematics 7, 150-153 (2001)
3. Goemans, M.X., Myung, Y.S.: A catalog of Steiner tree formulations. Networks 23(1), 19-28 (1993)
4. Polzin, T.: Algorithms for the Steiner Problem in Networks. PhD thesis, Saarland University, Saarbrcken (2003)
5. Wong, R.T.: A dual ascent approach for Steiner tree problems on a directed graph. Mathematical Programming 28(3), 271-287 (1984)
6. Daneshmand, S.V.: Algorithmic Approaches to the Steiner Problem in Networks. PhD thesis, University of Mannheim, Mannheim (2003)
7. Duin, C.W., Volgenant, A.: Reduction tests for the Steiner problem in graphs. Networks 19(5), 549-567 (1989)
8. Ribeiro, C.C., De Souza, M.C.: Tabu search for the Steiner problem in graphs. Networks 36(2), 138-146 (2000)
9. Ribeiro, C.C., Uchoa, E., Werneck, R.F.F.: A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing 14(3), 228-246 (2002)
10. Uchoa, E., Werneck, R.F.F.: Fast local search for Steiner trees in graphs. In: Blelloch, G.E., Halperin, D. (eds.) ALENEX, pp. 1-10. SIAM (2010)
11. Luipersbeck, M.: A new partition-based heuristic for the Steiner tree problem in large graphs. Master's thesis, Faculty of Informatics, Vienna University of Technology (December 2013)
12. Guschinskaya, O., Dolgui, A., Guschinsky, N., Levin, G.: A heuristic multi-start decomposition approach for optimal design of serial machining lines. European Journal of Operational Research 189(3), 902-913 (2008)
13. Taillard, ́ E.D., Voß, S.: POPMUSIC-Partial optimization metaheuristic under special intensification conditions. In: Essays and Surveys in Metaheuristics, pp. 613-629. Springer (2002)
14. Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing 20(1), 359-392 (1998)
15. Cherkassky, B.V., Goldberg, A.V.: On implementing the push-relabel method for the maximum flow problem. Algorithmica 19(4), 390-410 (1997)
16. Takahashi, H., Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Math. Japonica 24(6), 573-577 (1980)
17. Poggi de Aragäo, M., Werneck, R.F.F.: On the implementation of MST-based heuristics for the Steiner problem in graphs. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol. 2409, pp. 1-15. Springer, Heidelberg (2002)
18. Werneck, R.F.F.: Bossa (2003), http://www.cs.princeton.edu/~rwerneck/ bossa/(visited on January 20, 2014)
19. Koch, T., Martin, A., Voß, S.: SteinLib: An updated library on Steiner tree problems in graphs. Technical Report 00-37, ZIB, Takustr.7, 14195, Berlin (2000)
20. Leitner, M., Ljubic, I., Luipersbeck, M., Prossegger, M., Resch, M.: New real-world instances for the Steiner tree problem in graphs. Technical report, ISOR, University of Vienna (2014)