(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 2009
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. Chapter in Matheuristics – Hybridizing Metaheuristics and Mathematical Programming (V. Maniezzo, T. Stützle, S. Voss, eds.), volume 10 of Annals of Information Systems, pages 209–230, 2009, Springer.

Type
Book Section
Hybrid Mip Netdesign
Günther Raidl
Günther Raidl

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