Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem

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

Abstract

Full Citation:

Bin Hu, Markus Leitner, Günther R. Raidl. Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem. Journal of Heuristics, volume 14, number 5, pages 473-499, 2008.

Type
Journal Article
Hybrid Mip Netdesign Vns
Günther Raidl
Günther Raidl

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