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

Bin Hu, Markus Leitner, Günther Raidl
January 2006
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. 2006, Technical report TR 186–1–06–01, Institute of Computer Graphics and Algorithms, Vienna University of Technology.

Type
Technical Report
Hybrid Mip Netdesign Vns
Günther Raidl
Günther Raidl

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