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

Günther Raidl, Martin Gruber
January 2008
PDF bib

Abstract

Full Citation:

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

Type
Conference Paper
Hybrid Mip Netdesign
Günther Raidl
Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.