by Martin Gruber, Günther R. Raidl
Reference:
(Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree ProblemMartin Gruber, Günther R. RaidlChapter in Matheuristics – Hybridizing Metaheuristics and Mathematical Programming (V. Maniezzo, T. Stützle, S. Voss, eds.), volume 10 of Annals of Information Systems, pages 209–230, 2009, Springer.
Bibtex Entry:
@incollection{gruber-08d2,
author = {Martin Gruber and Günther R. Raidl},
title = {({M}eta-)Heuristic Separation of Jump Cuts in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem},
booktitle = {Matheuristics -- Hybridizing Metaheuristics and Mathematical Programming},
year = {2009},
editor = {V. Maniezzo and T. St\"utzle and S. Voss},
series = {Annals of Information Systems},
volume = 10,
pages = {209--230},
publisher = {Springer},
keywords = {netdesign,hybrid,mip},
url = {https://www.ac.tuwien.ac.at/files/pub/gruber-08d.pdf},
}