1 |
Narula, S. and Ho, C.(1980), Degree-constrained minimum spanning tree, Computers and Operations Research, 7, 239-249
|
2 |
Gilbert, E. (1967), Minimum cost communication networks, journal of Bell System: Technology, 9, 2209-2227
|
3 |
Graham, R. and Hell, P. (1985), On the history of the minimum spanning tree problem, Annals of the History of the Computing, 7, 43-57
|
4 |
Palmer, C. and Kershenbaum, A. (1995), An approach to a problem in network design using genetic algorithms, Networks, 26, 151-163
|
5 |
Goldberg, D. E. (1989), Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley
|
6 |
Gen, M. and Cheng, R. (1997), Genetic Algorithms and Engineering Design, John Wiley and Sons, Inc
|
7 |
Myung, Y. S., Lee, C. H. and Tcha, D. W. (1995), On the generalized minimum spanning tree problem, Networks, 26, 231-241
|
8 |
Bertsimas, D. (1990), The probabilistic minimum spanning tree problem, Networks, 20, 245-275
|
9 |
Shiode, I., Nishida, T. and Namasuya, Y. (1981), Stochastic spanning tree problem, Discrete Applied Mathematics, 3, 263-273
|