Subgradient Optimization Based Lagrangian Relaxation and Relax-and-Cut Approaches for the Bounded Diameter Minimum Spanning Tree Problem

Abstract

Full Citation:

Peter Putz. Subgradient Optimization Based Lagrangian Relaxation and Relax-and-Cut Approaches for the Bounded Diameter Minimum Spanning Tree Problem. October 2007, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. (Note: supervised by G.~Raidl)

Type