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

Günther Raidl, Martin Gruber
January 2008
PDF Cite
Type
Conference Paper
Hybrid Mip Netdesign
Günther Raidl
Günther Raidl

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