Mip

A Lagrangian Decomposition Based Heuristic for Capacitated Connected Facility Location

Proceedings of the 8th Metaheuristics International Conference (Stefan Voss and Marco Caserta), 2009.

Markus Leitner, Günther Raidl

Combining Lagrangian Decomposition with Very Large Scale Neighborhood Search for Capacitated Connected Facility Location

2009, Technical report TR 186-1-09-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.

Markus Leitner, Günther Raidl

Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows

Hybrid Metaheuristics 2009 (M. J. Blesa and others), volume 5818 of LNCS, pages 175-189, 2009, Springer.

Sandro Pirkwieser, Günther Raidl

Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search

Hybrid Metaheuristics 2009 (M. J. Blesa and others), volume 5818 of LNCS, pages 84-99, 2009, Springer.

Jakob Walla, Mario Ruthmair, Günther Raidl

Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates

Journal of Mathematical Modelling and Algorithms, volume 8, number 3, pages 293-334, 2009.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/chwatal-08a.pdf

Andreas M. Chwatal, Günther Raidl, Karin Oberlechner

Lagrangian Relax-and-Cut and Hybrid methods for the Bounded Diameter and the Hop Constrained Minimum Spanning Tree Problems

May 2008, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and M. Gruber

Ferdinand Zaubzer

(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.

Martin Gruber, Günther 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.

Martin Gruber, Günther Raidl

A Lagrangian Relax-and-Cut Approach for the Bounded Diameter Minimum Spanning Tree Problem

Numerical Analysis and Applied Mathematics (T. E. Simos and others), volume 1048 of AIP Conference Proceedings, pages 446-449, 2008, American Institute of Physics.

Günther Raidl, Martin Gruber

Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search

Journal of Heuristics, volume 14, number 5, pages 457-472, 2008.

Jakob Puchinger, Günther Raidl