A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

Raidl, Günther R.; Gruber, Martin

by Günther R. Raidl, Martin Gruber

Reference:

A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree ProblemGünther R. Raidl, Martin GruberNumerical Analysis and Applied Mathematics (T. E. Simos, others, eds.), volume 1048 of AIP Conference Proceedings, pages 446–449, 2008, American Institute of Physics.

Bibtex Entry:

@INPROCEEDINGS{raidl-08b,
author = {G\"unther R. Raidl and Martin Gruber},
title = {A {L}agrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem},
booktitle = {Numerical Analysis and Applied Mathematics},
series = {AIP Conference Proceedings},
volume = 1048,
editor = {T. E. Simos and others},
publisher = {American Institute of Physics},
year = 2008,
pages = {446--449},
keywords = {hybrid,netdesign,mip}, 
url = {https://www.ac.tuwien.ac.at/files/pub/raidl-08b.pdf},
}