A Hybrid GRASP with Perturbations and Adaptive Path-Relinking for the Steiner Problem in Graphs
暂无分享,去创建一个
[1] C. Ribeiro,et al. Reactive Tabu Search with Path-Relinking for the Steiner Problem in Graphs , 2002 .
[2] Thorsten Koch,et al. Solving Steiner tree problems in graphs to optimality , 1998, Networks.
[3] Celso C. Ribeiro,et al. Local search with perturbations for the prize‐collecting Steiner tree problem in graphs , 2001, Networks.
[4] S. Voß,et al. Efficient path and vertex exchange in steiner tree algorithms , 1997 .
[5] Mauricio G. C. Resende,et al. Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..
[6] Celso C. Ribeiro,et al. A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy , 2000, J. Glob. Optim..
[7] M. Gendreau,et al. A tabu search heuristic for the Steiner Tree Problem , 1999, Networks.
[8] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[9] Fred Glover,et al. Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory , 1999, INFORMS J. Comput..
[10] M. Minoux. Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity , 1990 .
[11] Fred W. Glover,et al. Using tabu search to solve the Steiner tree-star problem in telecommunications network design , 1996, Telecommun. Syst..
[12] Fred W. Glover,et al. Tabu Search , 1997, Handbook of Heuristics.
[13] Celso C. Ribeiro,et al. Greedy randomized adaptive search procedures for the Steiner problem in graphs. , 1997 .
[14] Stefan Voß,et al. Steiner's Problem in Graphs: Heuristic Methods , 1992, Discret. Appl. Math..
[15] Choukhmane El-Arbi. Une heuristique pour le problème de l'arbre de Steiner , 1978 .
[16] Pawel Winter. Reductions for the rectilinear steiner tree problem , 1995, Networks.
[17] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[18] Irène Charon,et al. The noising method: a new method for combinatorial optimization , 1993, Oper. Res. Lett..
[19] Pawel Winter,et al. Steiner problem in networks: A survey , 1987, Networks.
[20] M. Resende,et al. A probabilistic heuristic for a computationally difficult set covering problem , 1989 .
[21] Fred Glover,et al. Multi-Start and Strategic Oscillation Methods - Principles to Exploit Adaptive Memory , 2000 .
[22] A. Volgenant,et al. An edge elimination test for the steiner problem in graphs , 1989 .
[23] Celso C. Ribeiro,et al. Tabu search for the Steiner problem in graphs , 2000, Networks.
[24] Victor J. Rayward-Smith,et al. On finding steiner vertices , 1986, Networks.
[25] Hans Jürgen Prömel,et al. The Steiner Tree Problem , 2002 .
[26] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[27] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[28] J. Plesník. A bound for the Steiner tree problem in graphs , 1981 .
[29] G. D. Smith,et al. Solving the Graphical Steiner Tree Problem Using Genetic Algorithms , 1993 .
[30] F. Glover,et al. Fundamentals of Scatter Search and Path Relinking , 2000 .
[31] Fred Glover,et al. Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .
[32] Celso C. Ribeiro,et al. A Parallel GRASP for the Steiner Problem in Graphs , 1998, IRREGULAR.
[33] N. Maculan. The Steiner Problem in Graphs , 1987 .
[34] Celso C. Ribeiro,et al. Preprocessing Steiner problems from VLSI layout , 2002, Networks.
[35] Henrik Esbensen. Computing Near-Optimal Solutions to the Steiner Problem in a Graph Using a Genetic Algorithm , 1994 .
[36] K. Dowsland. HILL-CLIMBING, SIMULATED ANNEALING AND THE STEINER PROBLEM IN GRAPHS , 1991 .
[37] Ehl Emile Aarts,et al. Local search for Steiner tree problems in graphs , 1996 .
[38] Stefan Voss,et al. Steiner-Probleme in Graphen , 1990 .