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

Hu, Bin; Leitner, Markus; Raidl, Günther R.

by Bin Hu, Markus Leitner, Günther R. Raidl

Reference:

Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree ProblemBin Hu, Markus Leitner, Günther R. Raidl2006, Technical report TR 186–1–06–01, Institute of Computer Graphics and Algorithms, Vienna University of Technology.

Bibtex Entry:

@TECHREPORT{hu-06,
author = {Bin Hu and Markus Leitner and G\"unther R. Raidl},
title = {Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem},
institution = {Institute of Computer Graphics and Algorithms, Vienna University of Technology},
address = {Vienna, Austria},
year = {2006},
number = {TR 186--1--06--01},
url = {https://www.ac.tuwien.ac.at/files/pub/hu-06.pdf},
keywords = {netdesign,vns,hybrid,mip}
}