(Meta-)Heuristic Separation of Jump Cuts 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 for the Bounded Diameter Minimum Spanning Tree Problem. Proceedings of Matheuristics 2008: Second International Workshop on Model Based Metaheuristics (P. Hansen and others), 2008.

Type
Conference Paper
Hybrid Mip Netdesign
Günther Raidl
Günther Raidl

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