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. RaidlJournal of Heuristics, volume 14, number 5, pages 473–499, 2008.

Bibtex Entry:

@ARTICLE{hu-08b,
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},
journal = {Journal of Heuristics},
volume = {14},
number = {5},
year = {2008},
pages = {473--499},
url = {https://www.ac.tuwien.ac.at/files/pub/hu-06.pdf},
keywords = {netdesign,vns,hybrid,mip}
}