1 |
Beasley, J.E., "An Algorithm for the Steiner Problem in Graphs," Networks, Vol.14(1984), pp.147-159.
DOI
ScienceOn
|
2 |
Dorigo, M. and L.M. Gambardella, "Ant Colony System : A Cooperative Learning Approach to the Traveling Salesman Problem," IEEE Transactions on Evolutionary Computation, Vol.1 (1997), pp.53-66.
DOI
|
3 |
Duin, C.W and S. Voss, "Steiner tre heuristics- A survey," Operations Research Proceedings, Springer-Verlag, Berlin, 1994, pp.485-496.
|
4 |
Kapsalis, A., V.J. Rayward-Smith, and G.D. Smith, "Solving the Graphical Steiner Tree Problem Using Genetic Algorithms," Journal of Operation Research Society, Vol.44(1993), pp. 397-406.
DOI
|
5 |
Hwang, F.K., D.S. Richard, and p.Winter, The Steiner Tree Problem. North-Holland, Publishing Company, Amsterdam, Netherlands. 1992.
|
6 |
Melkonian V. "New primal-dual algorithms for Steiner tree problems," Vol.34(2007), pp.2147-2167.
|
7 |
Minoux, M., "Efficient Greedy Heuristics for Steiner Tree problems Using Reoptimization and Supermodularity," INFOR, Vol.28(1990), pp.221-233.
|
8 |
Schiemangk, C. "Thermodynmically Motivated Simulation for Solving the Steiner Tree Problem and the Optimization of Interacting Path Systems," Optimization of Connection Structures in Graphs, Iwainsky, A(ed.), CICIP, East Berlin, GDR, 1985, pp.74-90.
|
9 |
Prim, R.C. "Shortest Connection Networks and Some Generalisations," Bell System Technical Journal, Vol.36(1957), pp.1389-1401.
DOI
|
10 |
Duin, C.W. and A, Volgenant, "Reduction Tests for the Steiner Problem in Graphs," Networks, Vol.19(1989), pp.549-567.
DOI
|
11 |
Voss, S. "Steiner's Problem in Graphs: Heuristic Methods," Discrete Applied Mathematics, Vol. 40(1992), pp.45-72.
DOI
ScienceOn
|
12 |
Blum, C. and M. Dorigo, "The Hyper-Cube Framework for Ant Colony Optimization," IEEE Transactions on Systems, Man, and Cybernetics- Part B, Vol.34(2004), pp.1161-1172.
DOI
ScienceOn
|
13 |
Koch, T., A. Martin, and S. Voss, "SteinLib : An Updated Library on Steiner Tree Problems in Graphs," Technical Report ZIB-Report 00- 37, Konrad-Zuse-Zentrum fűr Informationstechnik Berlin, 2000.
|
14 |
Maculan, N., p.Souza and A.C. Vejar, "An Approach for the Steiner Problem in Directed Graphs." Annals of Operations Research, Vol.33 (1991), pp.471-480.
DOI
|
15 |
Ribeiro, C.C. and M.C. De Souza, Tabu Search for the Steiner Problem in Graphs. Networks, Vol.36(2000), pp.138-146.
DOI
ScienceOn
|
16 |
Xu, j., S.Y. Chiu, and F. Glover, "Using Tabu Search to Solve the Steiner Tree-Star Problem in Telecommunications Network Design, Telecommunications Syst, Vol.6(1996), pp.117-125.
DOI
|
17 |
Dowsland, K.A. Hill-climing, "Simulated Annealing and the Steiner Problem in Graphs," Eng. Optimization, Vol.17(1991), pp.91-107.
DOI
ScienceOn
|
18 |
Singh, G., S. Das, S. Gosavi, and S. Pujar, Ant colony algorithms for Steiner trees: an application to routing in sensor networks. In Recent Developments in Biologically Inspired Computing, L.N. de Castro and F.J. von Zuben, Eds. Idea Group Inc., Chapter, Vol.6(2004).
|
19 |
Xu, J., S.Y. Chiu, and F. Glover, "Probabilistic Tabu Search for Telecommunications Network Design," Combin Optim Theory Pract, Vol.1 (1997), pp.69-94.
|
20 |
Bahiense L., F. Barahona and O. Porto, "Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation," J. of Combinatorial Optimization, Vol.7(2003), pp.259-282.
DOI
|
21 |
Esbensen, H., "Computing Near-Optimal Solutions to the Steiner Problem in a Graph Using a Genetic Algorithm," Networks, Vol.26(1995), pp.173-185.
DOI
|
22 |
Garey, M.R. and D.S. Johnson, Computers and Intractability : A Guide to Theory of NP-Completeness. Freeman, New York, 1979.
|
23 |
Dorigo, M., and T. Stützle, Ant Colony Optimization., The MIT press, London, England, 2004.
|