Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search

Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search (2000)

Cached

Download Links

by Günther R. Raidl , Franz Rothlauf , Dr. Armin Heinzl , Jens Gottlieb , Jens Gottlieb , Sap Ag , Giinther R. Raidl , Bryant A. Julstrom , Bryant A. Julstrom

Citations:

18 - 7 self

BibTeX

@MISC{Raidl00prüfernumbers:,
    author = {Günther R. Raidl and Franz Rothlauf and Dr. Armin Heinzl and Jens Gottlieb and Jens Gottlieb and Sap Ag and Giinther R. Raidl and Bryant A. Julstrom and Bryant A. Julstrom},
    title = {Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search},
    year = {2000}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

281	Theoretical improvements in algorithmic efficiency for network flow problems - Edmonds, Karp - 1970
128	On Steiner’s problem with rectilinear distance,” in Proc - Hanan - 1966
81	A theorem on trees - Cayley
45	Representing trees in genetic algorithms - Palmer, Kershenbaum - 1994
43	Genetics and random keys for sequencing and optimization - Bean - 1994
22	Comparison of algorithms for the degree constrained minimum spanning tree - Krishnamoorthy, Ernst, et al. - 2001
18	A genetic algorithm for the linear transportation problem - Vignaux, Michalewicz - 1991
16	A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem - Raidl, Julstrom - 2000
15	Network random keys – a tree network representation scheme for genetic and evolutionary algorithms - Rothlauf, Goldberg, et al. - 2002
15	A theorem on trees. Quarterly - Cayley - 1889
13	Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees - Abuali, Schoenefeld, et al. - 1994
13	Minimum Concave-Cost Network Flow Problems - Guisewite, Pardalos - 1990
11	A new evolutionary approach to the degree constrained minimum spanning tree problem - Knowles, Corne - 2000
10	Genetic algorithm for solving bicriteria network topology design problem - Kim, Gen
10	Pruefernumbers and genetic algorithms: A lesson how the low locality of an encoding can harm the performance of GAs - Rothlauf, Goldberg
9	Spanning tree-based genetic algorithm for the bicriteria fixed charge transportation problem - Gen, Li
6	A genetic algorithm with feasible search space for minimal spanning trees with time-dependent edge costs - Gargano, Edelson, et al. - 1998
5	Encoding rectilinear Steiner trees as lists of edges - Julstrom
4	A comparison of two representations for the fixed charge transportation problem - Gottlieb, Eckert - 2000
3	Genetic algorithms for the fixed charge transportation problem - Gottlieb, Paulmann - 1998
2	Algorithmic Combinatorics. The Macmillan Company - Even - 1973
2	Neuer Beweis eines Satzes ueber Permutationen. Archiv flit Mathematik und Physik - Prfifer - 1918
1	Archiv für Mathematik und Physik, 27: 742–744 - Raidl - 1918