An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem (bibtex)
by
Reference:
An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree ProblemG. R. RaidlProceedings of the 2000 IEEE Congress on Evolutionary Computation (C. Fonseca, others, eds.), pages 104–111, 2000, IEEE Press.
Bibtex Entry:
@INPROCEEDINGS{raidl-00c,
author = {G. R. Raidl},
title = {An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem},
booktitle = {Proceedings of the 2000 I{EEE} Congress on Evolutionary Computation},
editor = {C. Fonseca and others},
publisher = {IEEE Press},
year = 2000,
pages = {104--111},
url = {https://www.ac.tuwien.ac.at/files/pub/raidl-00c.pdf},
keywords = {evolcomp,netdesign},
}
Powered by bibtexbrowser