Mip

On the Minimum Label Spanning Tree Problem: Solution Methods and Applications
May 2010, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~R.~Raidl and U.~Pferschy
PDF Cite
Solving Two Network Design Problems by Mixed Integer Programming and Hybrid Optimization Methods
May 2010, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~R.~Raidl and U.~Pferschy
PDF Cite
Branch-and-Cut-and-Price for Capacitated Connected Facility Location
2010, Technical report TR 186-1-10-01, Vienna University of Technology.
PDF Cite
Metaheuristic Hybrids
Chapter in Handbook of Metaheuristics (Michel Gendreau and Jean Yves Potvin), volume 146 of International Series in Operations Research & Management Science, pages 469-496, 2010, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-08a.pdf
Cite
Strong Lower Bounds for a Survivable Network Design Problem
ISCO 2010 – International Symposium on Combinatorial Optimization (M. Haouari and A. R. Mahjoub), volume 36 of Electronic Notes in Discrete Mathematics, pages 295-302, 2010, Elsevier.
PDF Cite
The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search
Networks, volume 55, number 3, pages 256-275, 2010.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/hu-07.pdf
Cite
The Multidimensional Knapsack Problem: Structure and Algorithms
INFORMS Journal on Computing, volume 22, number 2, pages 250-265, 2010.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/puchinger-07.pdf
Cite
Accelerating Column Generation for a Survivable Network Design Problem
Proceedings of the International Network Optimization Conference 2009 (M. G. Scutellá and others), April 2009.
PDF Cite
Solving a Multi-Constrained Network Design Problem by Lagrangean Decomposition and Column Generation
International Network Optimization Conference 2009 (Maria Grazia Scutellà and others), April 2009.
PDF Cite
(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 and T. Stützle and S. Voss), volume 10 of Annals of Information Systems, pages 209-230, 2009, Springer.
PDF Cite