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

Martin Gruber, Jano Van Hemert, Günther Raidl
January 2006
PDF bib

Abstract

Full Citation:

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

Type
Conference Paper
Aco Ea Netdesign Vns
Günther Raidl
Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.