(Meta-)Heuristic Separation of Jump Cuts in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

Martin Gruber, Günther Raidl
January 2008
PDF bib

Abstract

Full Citation:

Martin Gruber, Günther R. Raidl. (Meta-)Heuristic Separation of Jump Cuts in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. 2008, Technical report TR 186-1-08-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.

Type
Technical Report
Hybrid Mip Netdesign
Günther Raidl
Günther Raidl

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