Mip

Metaheuristic Hybrids
Chapter in Handbook of Metaheuristics (Michel Gendreau and Jean Yves Potvin), pages 385-417, 2019, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/raidl-19.pdf
Cite
Advances in Decomposition Approaches for Mixed Integer Linear Programming
November 2018, PhD thesis, Institute of Logic and Computation, TU Wien.
Note: supervised by G.~R.~Raidl
PDF Cite
Exact approaches for the directed network design problem with relays
2018, Technical report AC-TR-18-001, Algorithms and Complexity Group, TU Wien.
PDF Cite
Exact approaches for the directed network design problem with relays
Omega, 2018.
PDF Cite DOI
Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition
Computers & Operations Research, volume 96, pages 30-54, 2018.
PDF Cite DOI
An Iterative Time-Bucket Refinement Algorithm for High Resolution Scheduling Problems
October 2017, Master’s thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl, M. Riedler, and J. Maschler
PDF Cite
Hierarchical Clustering and Multilevel Refinement for the Bike-Sharing Station Planning Problem
Conference Proceedings of Learning and Intelligent Optimization Conference (LION~11) (Roberto Battiti and Dmitri Kvasov and Yaroslav Sergeyev), volume 10556 of LNCS, pages 1-16, 2017, Springer.
PDF Cite DOI
Complete Solution Archives for Evolutionary Combinatorial Optimization: Application to a Competitive Facility Location and Stochastic Vehicle Routing Problem
April 2016, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~R.~Raidl and B.~Hu
PDF Cite
Hybrid Metaheuristics -- Powerful Tools for Optimization
2016, Springer.
PDF Cite Project
Solving a Selective Dial-a-Ride Problem with Logic-based Benders Decomposition
2016, Technical report AC-TR-16-007, Algorithms and Complexity Group, TU Wien.
PDF Cite