A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Ruthmair, Mario; Raidl, Günther R.

by Mario Ruthmair, Günther R. Raidl

Reference:

A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree ProblemMario Ruthmair, Günther R. RaidlProceedings of the 13th International Conference on Computer Aided Systems Theory: Part I (R. Moreno-Díaz, others, eds.), volume 6927 of LNCS, pages 351–358, 2012, Springer.

Bibtex Entry:

@InProceedings{ruthmair-12,
	title = {A Memetic Algorithm and a Solution Archive for the Rooted Delay-Constrained Minimum Spanning Tree Problem},
	booktitle = {{Proceedings of the 13th International Conference on Computer Aided Systems Theory: Part I}},
	series = {{LNCS}},
	author = {Mario Ruthmair and G{\"u}nther R. Raidl},
	editor = {R. Moreno-D{\'i}az and others},
	publisher = {Springer},
	pages = {351--358},
	volume = {6927},
	year = {2012},
keywords = {netdesign,evolcomp},
	url = {https://www.ac.tuwien.ac.at/files/pub/ruthmair-12.pdf},
}