Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges

Julstrom, B. A.; Raidl, G. R.

by B. A. Julstrom, G. R. Raidl

Reference:

Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of EdgesB. A. Julstrom, G. R. RaidlProceedings of the 2002 ACM Symposium on Applied Computing (G. Lamont, others, eds.), pages 547–552, 2002, ACM Press.

Bibtex Entry:

@INPROCEEDINGS{julstrom-02,
author = {B. A. Julstrom and G. R. Raidl},
title = {Initialization is Robust in Evolutionary Algorithms that Encode Spanning Trees as Sets of Edges},
booktitle = {Proceedings of the 2002 ACM Symposium on Applied Computing},
editor = {G. Lamont and others},
publisher = {{ACM} Press},
year = 2002,
pages = {547--552},
url = {https://www.ac.tuwien.ac.at/files/pub/julstrom-02.pdf},
keywords = {evolcomp,netdesign},
}