Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search

Bin Hu, Markus Leitner, Günther Raidl
January 2005
PDF bib

Abstract

Full Citation:

Bin Hu, Markus Leitner, Günther R. Raidl. Computing Generalized Minimum Spanning Trees with Variable Neighborhood Search. Proceedings of the 18th Mini Euro Conference on Variable Neighborhood Search (Pierre Hansen, Nenad Mladenović, José A. Moreno Pérez, Belén Melián Batista, J. Marcos Moreno-Vega, eds.), 2005.

Type
Conference Paper
Hybrid Netdesign Vns
Günther Raidl
Günther Raidl

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