Heuristic Cut Separation in a Branch\&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

Abstract

Full Citation:

Martin Gruber, Günther R. Raidl. Heuristic Cut Separation in a Branch&Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem. Proceedings of the 2008 International Symposium on Applications and the Internet, SAINT 2008, pages 261–264, 2008, IEEE Computer Society.

Günther Raidl

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