Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem

Ruthmair, Mario; Hubmer, Andreas; Raidl, Günther R.

by Mario Ruthmair, Andreas Hubmer, Günther R. Raidl

Reference:

Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree ProblemMario Ruthmair, Andreas Hubmer, Günther R. RaidlExtended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia, others, eds.), pages 285–287, 2011.

Bibtex Entry:

@InProceedings{ruthmair-11,
  author = {Mario Ruthmair and Andreas Hubmer and G{\"u}nther R. Raidl},
  title = {Using a Solution Archive to Enhance Metaheuristics for the Rooted Delay-Constrained Minimum Spanning Tree Problem},
  booktitle = {Extended Abstracts of EUROCAST 2011 -- 13th International Conference on Computer Aided Systems Theory},
  address = {Las Palmas de Gran Canaria, Spain},
  editor = {Alexis Quesada-Arencibia and others},
  pages = {285--287},
  year = {2011},
keywords = {netdesign},
  url = {https://www.ac.tuwien.ac.at/files/pub/ruthmair-11.pdf},
}