Team
Research
Courses
News
Jobs
Contact
Internal
Light
Dark
Automatic
Vns
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.
Martin Gruber
,
Jano Van Hemert
,
Günther Raidl
PDF
Cite
Variable Neighborhood Descent with Self-Adaptive Neighborhood-Ordering
Proceedings of the 7th EU/MEeting on Adaptive, Self-Adaptive, and Multi-Level Metaheuristics
(Carlos Cotta and Antonio J. Fernandez and Jose E. Gallardo), 2006.
Bin Hu
,
Günther Raidl
PDF
Cite
Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search
Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search
(Pierre Hansen and Nenad Mladenović and José A. Moreno Pérez and Belén Melián Batista and J. Marcos Moreno-Vega), 2005.
Bin Hu
,
Markus Leitner
,
Günther Raidl
PDF
Cite
Variable Neighborhood Search for the Bounded Diameter Minimum Spanning Tree Problem
Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search
(Pierre Hansen and Nenad Mladenović and José A. Moreno Pérez and Belén Melián Batista and J. Marcos Moreno-Vega), 2005.
Martin Gruber
,
Günther Raidl
PDF
Cite
«
Cite
×