Mip

Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization
Chapter in Hybrid Metaheuristics – An Emergent Approach for Combinatorial Optimization (C. Blum and M. J. Blesa Augilera and A. Roli and M. Sampels), volume 114 of Studies in Computational Intelligence, pages 31-62, 2008, Springer.
PDF bib
Combining Variable Neighborhood Search with Integer Linear Programming for the Generalized Minimum Spanning Tree Problem
Journal of Heuristics, volume 14, number 5, pages 473-499, 2008.
PDF bib
Exact Methods and Metaheuristic Approaches for Deriving High Quality Fully Resolved Consensus Trees
BIRD'08, 2nd International Conference on Bioinformatics Research and Development, Poster Presentations (J. Küng and K. Schneider and R. Wagner), volume 26 of Schriftenreihe Informatik, pages 115-124, 2008, Trauner Verlag.
PDF bib
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.
PDF bib
A Directed Cut Model for the Design of the Last Mile in Real-World Fiber Optic Networks
Proceedings of the International Network Optimization Conference 2007 (Bernard Fortz), pages 103/1-6, 2007.
PDF bib
A Multi-Commodity Flow Approach for the Design of the Last Mile in Real-World Fiber Optic Networks
Operations Research Proceedings 2006 (Karl-Heinz Waldmann and Ulrike M. Stocker), 2007, Springer.
PDF bib
Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem
Numerical Analysis and Applied Mathematics (T. E. Simos), volume 936 of AIP Conference Proceedings, pages 444-447, 2007, American Institute of Physics.
PDF bib
The Generalized Minimum Edge Biconnected Network Problem: Efficient Neighborhood Structures for Variable Neighborhood Search
2007, Technical report TR 186-1-07-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
PDF bib
The Multidimensional Knapsack Problem: Structure and Algorithms
2007, Technical report TR 186-1-07-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
PDF bib
Bringing Order into the Neighborhoods: Relaxation Guided Variable Neighborhood Search
2006, Technical report TR 186-1-06-02, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
PDF bib