Günther R. Raidl
- 1.F. N. Abuali, D. A. Schoene~eld, and R. L. Wainwright. Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees. In E. Deaton, D. Oppenheim, J. Urban, and H. Berghel, editors, Proceedings of the 199J A CM Symposium on Applied Computing, pagcs 242-246, New York, 1994. ACM Press. Google Scholar
Digital Library
- 2.F. N. Abuali, R. L. Wainwright, and D. A. Schoenefeld. Determinant factorization: A new encoding scheme for spanning trees applied to the probabilistic minimum spanning tree problem. In L. J. Eshelman, editor: Proceedings of the Sixth International Conference on Genetic Algorithms, pages 470--477, San Marco, CA, 1995. Morgan Kaufmann Publishers. Google ScholarDigital Library
- 3.F. N. Abuali, R. L. Wainwright, and D. A. Schoenefeld. Solving the three-star tree isomorphism problem using genetic algorithms. In K. M. George, J. H. Carroll, E. Deaton, D. Oppenheim, and J. Hightower, editors, Proceedings of the 1995 A CM Symposium on Applied Computing, pages 337-343, New York, 1995. ACM Press. Google ScholarDigital Library
- 4.B. Boldon, N. Dec, and N. Kumar. Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine. Technical Report CS-T1~-95-02, Department of Computer Science, University of Central Florida, Orlando, FL, 1995.Google Scholar
- 5.J. Branke and M. Middend(~rf. Searching for shortest common supersequences by means of a heuristic-based genetic algorithm. In J. T. Alander, editor, Proceedings of the Second Nordic Workshop on Genetic Algorithms and their Applications, pages 105-113, University of Vaasa, Vaasa, Finland, 1996.Google Scholar
- 6.S. Brave and A. S. Wu, editors. Late Breaking Papers at the t999 Genetic and EvolutionaT~j Computation Conferencc, Orlando, FL, 1999.Google Scholar
- 7.A. C~ylcy. A theorem on trees. Quarterly Journal of Mathematics, 23:376-378, t889.Google Scholar
- 8.B. Dengiz, F. Altiparmak, and A. E. Smith. Local search genetic algorithm for optimization of highly reliable communications networks. In T. Back, editor, Proceedings of the Seventh International Conference on Genetic Algorithms, pages 650-657, San Francisco, CA, 1997. Morgan Kaufmann Publishers.Google Scholar
- 9.A. E. Eiben and J. K. van der Hauw. Solving 3-SAT by GAs adapting constraint weights. In Proceedings of 1997 IEEE rnternational Conference on Evotutior~. ary Computation, pages 81-86, Indianapolis, IN, 1997. IEEE Press.Google Scholar
- 10.51. Even. Algorithmic Combinatorics. The Macmillan Company, New York, 1973.Google Scholar
- 11.$. Fekete, S. Khuller, M. Klemmstein, B. Raghavachaxi, and N. Young. A network-flow technique for finding low-weight bounded-degree spanning trees. Journal of Algorithms, 24:310-324, 1997. Google ScholarDigital Library
- 12.M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-UompleteheSS. W. H. Freeman, New York, 1979. Google ScholarDigital Library
- 13.M. L. Gaxgano, W. Edelson, and O. Koval. A genetic algorithm with feasible search space for minimal spanning trees with time-dependent edge costs. In Koza et al. {19}, page 495.Google Scholar
- 14.M. Gen, G. Zhou, and M. Takayama. A comparative study of tree encodings on spanning tree problems. In Proceedings of the 1998 IEEE International Conference on Evolutionary Computation Proceedings, pages 33- 38, Anchorage, AL, 1998. IEEE Press.Google ScholarCross Ref
- 15.B. A. julstrom. Representing rectilinear Steiner trees in genetic algorithms. In K. M. George, J. H. Carroll, D. Oppenheim, and J. Hightower, editors, Proceedings of the 1996 A C'M Symposium on Applied Computing, pages 245-250, New York, 1996. ACM Press. Google ScholarDigital Library
- 16.B. A. Julstrom. Insertion decoding algorithms and initial tours in a weight-coded GA for TSP. In Koza et al. {19}, pages 528-534.Google Scholar
- 17.J. R. Kim and M. Glen. Genetic algorithm for solving bicriteri~ network topology design problem. In Porto {25}, pages 2272-2279.Google Scholar
- 18.J. Knowles and D. Corne. A new evolutionary approach to the degree constrained minimum spanning tree problem. {EEE Transactions on Evolutionar~d Computation, to appear. Google ScholarDigital Library
- 19.J. R. Koza, W. Banzhaf. K. Cheltapilla, K. Deb, M. Dorigo, D- B. Fogel, H. Iba, and P~. L. Riolo, editors. Genetic Programming 1998: PTvccedin~s of the Third Annual Conference, Madison, Wisconsin, 1998. Morgan Kaufmann. Google ScholarDigital Library
- 20.J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematics Society, 7(1):48-50, 1956.Google ScholarCross Ref
- 21.C. Monma and S. Suri. Transitions in geometric minimum spanning trees. Discrete and Computational Geometry, 8(3):265- 293, 1992.Google ScholarDigital Library
- 22.S. C. Narula and C. A. Ho. Degree-constrained minimum spanning trees. Computers and Operations Research, 7:239-249, 1980.Google ScholarCross Ref
- 23.C. C. Palmer and A. Kershenbaum. Representing trees in genetic algorithms. In Proceedings of the First IEEE Conference on Evolutionary Computation, pages 379- 384, Orlando, FL, 1994. IEEE Press.Google ScholarCross Ref
- 24.C. H. Papadimitriou and U. V. Vaziraifi. On two geometric problems related to the traveling salesman problem. Journal of Algorithms, 5:231-246, 1984.Google ScholarCross Ref
- 25.V. W. Porto, editor. Proceedings of the 1999 IEEE Con#russ on Evolutionary Computation, Piscataway: N J, 1999. IEEE Press.Google Scholar
- 26.R. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389- 1401, 1957.Google ScholarCross Ref
- 27.G. R. Raidl. A weight-coded genetic algorithm for the multiple container packing problem. In J. Carroll, H. Hiddad, D. Oppenheim, B. Bryant, and G. B. Lamont, editors, Proceedings of the 1999 A CM Symposium on Applied Computing, pages 291-296, New York, 1999. ACM Press. Google ScholarDigital Library
- 28.G. R. Raidl. Weight-codings in a genetic algorithm for the m~alticoas%~aint knapsack problem. In Porto {25}, pages 596-603.Google Scholar
- 29.G. It. Raidl and J. Gottlieb. On the importance of pheaotypic duplicate elimination in decoder-based evolutionaxy algorithms. In Brave and Wu {6}, pages 204- 211.Google Scholar
- 30.F. Rothlauf and D. Goldberg. Tree network design with genetic algorithms - an investigation in the locality of the Pruefernumber encoding, lu Brave and Wu {6}, pages 238-243.Google Scholar
- 31.M. Saveisbergh and T. Volgcnant. Edge exchanges in the degree-constrained minimum spanning tree problem. Computers and Operations Research, 12(4):341- 348, 1985.Google ScholarCross Ref
- 32.G. Zhou and M. Gun. Approach to degree-constrained minimum spanning tree problem using genetic algorithm. Engineering Desing ~ Automation, 3(2):157- 165, 1997.Google Scholar
Index Terms
- A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem
Recommendations
An ant-based algorithm for finding degree-constrained minimum spanning tree
GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computationA spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spanning tree of minimum cost in an edge weighted graphis well known to be NP-...
A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains
ISPAN '99: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and NetworksThe Minimum Spanning Tree (MST) problem with an added constraint that no node in the spanning tree has the degree more than a specified integer d, is known as the Degree-Constrained MST (d-MST) problem. Since computing the d-MST is NP-hard for every d ...
Minimum Spanning Tree Problem Research Based on Genetic Algorithm
ISCID '09: Proceedings of the 2009 Second International Symposium on Computational Intelligence and Design - Volume 02Minimum Spanning Tree (MST) problem is of high importance in network optimization, but it is also difficult for the traditional network optimization technique to deal with. In this paper, self-adaptive genetic algorithm (GA) approach is developed to ...
Comments