(Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem (bibtex)
by ,
Reference:
(Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree ProblemMartin Gruber, Günther R. Raidl2008, Technical report TR 186–1–08–02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
Bibtex Entry:
@TECHREPORT{gruber-08d,
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},
institution = {Institute of Computer Graphics and Algorithms, Vienna University of Technology},
address = {Vienna, Austria},
number = {TR 186--1--08--02},
year = {2008},
keywords = {netdesign,hybrid,mip},
url = {https://www.ac.tuwien.ac.at/files/pub/gruber-08d.pdf},
}
Powered by bibtexbrowser