A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem (bibtex)
by ,
Reference:
A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree ProblemG. R. Raidl, C. DrexelLate Breaking Papers at the 2000 Genetic and Evolutionary Computation Conference, pages 309–316, 2000.
Bibtex Entry:
@INPROCEEDINGS{raidl-00b,
author = {G. R. Raidl and C. Drexel},
title = {A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem},
booktitle = {Late Breaking Papers at the 2000 Genetic and Evolutionary Computation Conference},
address = {Las Vegas, NV},
year = 2000,
pages = {309--316},
url = {https://www.ac.tuwien.ac.at/files/pub/raidl-00b.pdf},
keywords = {evolcomp,netdesign},
}
Powered by bibtexbrowser