Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACO

Gruber, Martin; Hemert, Jano van; Raidl, Günther R.

by Martin Gruber, Jano van Hemert, Günther R. Raidl

Reference:

Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA, and ACOMartin Gruber, Jano van Hemert, Günther R. RaidlProceedings of the Genetic and Evolutionary Computation Conference – GECCO 2006 (Maarten Keijzer, others, eds.), pages 1187–1194, 2006, ACM.

Bibtex Entry:

@INPROCEEDINGS{gruber-06,
author = {Martin Gruber and Jano van Hemert and G\"unther R. Raidl},
title = {Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a {VNS}, {EA}, and {ACO}},
booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference -- GECCO 2006},
editor = {Maarten Keijzer and others},
year = {2006},
volume = {2},
pages = {1187--1194},
address = {Seattle, USA},
publisher = {ACM},
keywords = {netdesign,vns,ea,aco},
url = {https://www.ac.tuwien.ac.at/files/pub/gruber-06.pdf},
}