1 |
David J. Thuente and Pulin Sampat, 'Mathematical Programming in A Hybrid Genetic Algorithm for Steiner point Problems', Proc.of the ACM symposium, 1995
|
2 |
Cockayne and D.E.Hewgill, 'Improved Computation of Plane Steiner Topology, Agorithmica, Vol.7, pp.219-229, 1992
DOI
|
3 |
Jianhua Jiang, 'Rigorous Analysis and Design of Diffractive Optical Elements', A Dissertation, Univ. Alabama, pp.74-89, 2000
|
4 |
Pawel Winter, 'An algorithm for the Steiner problem in the Euclidean plan', Networks, Vol.15, pp.323-345, 1985
DOI
ScienceOn
|
5 |
G.R.Raidl and B.A.Julstrom, 'Edge-Sets: An Effective Evolutionary Coding of Spanning Trees', Technishe Univ., Technical Report, 2002
|
6 |
Pawel Winter and Martin Zachariasen, 'Euclidean Steiner Minimum Trees: An Improved Exact Algorithm', Networks, Vol.30, pp.149-166, 1997
DOI
ScienceOn
|
7 |
Richard Courant and Herbert Robbins, What is Mathematics?, Second Edition, Oxford University Press, 1996
|
8 |
Joseph Jones, Frederick C and Harris.Jr, 'A Genetic Algorithm for the Steiner Minimal Tree Problem', ISCA's Int. Conf. on Intelligent Systems, 1996
|
9 |
Zbigniew Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Third Extended Edition, Springer-Verlag, 1995
|
10 |
Jorge Barreiros, 'An Hierarchic Genetic Algorithm for Comuting (near)Optimal Euclidean Steiner Trees', GECC02003, pp.56-65, 2003
|