by B. A. Julstrom, G. R. Raidl
Reference:
A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree ProblemB. A. Julstrom, G. R. Raidlin 2003 Genetic and Evolutionary Computation Conference's Workshops Proceedings, Workshop on Analysis and Design of Representations (A. Barry, F. Rothlauf, D. Thierens, others, eds.), pages 2–7, 2003.Note: best paper award winner of the workshop
Bibtex Entry:
@INPROCEEDINGS{julstrom-03,
author = {B. A. Julstrom and G. R. Raidl},
title = {A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem},
booktitle = {in 2003 Genetic and Evolutionary Computation Conference's Workshops Proceedings, Workshop on Analysis and Design of Representations},
note ={best paper award winner of the workshop},
editor = {A. Barry and F. Rothlauf and D. Thierens and others},
pages = {2--7},
url = {https://www.ac.tuwien.ac.at/files/pub/julstrom-03.pdf},
year = 2003,
keywords = {evolcomp,netdesign},
}