Mip

Time-Bucket Relaxation Based Mixed Integer Programming Models for Scheduling Problems: A Promising Starting Point for Matheuristics
Proceedings of Matheuristics 2016: 6th International Workshop on Model-Based Metaheuristics (T. Stützle and V. Maniezzo), pages 104-107, 2016.
PDF Cite
Solving the Travelling Thief Problem with an Evolutionary Algorithm
September 2015, Master’s thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and B. Hu
PDF Cite
Electric Vehicles Recharge Scheduling with Logic-Based Benders Decomposition
July 2015, Master’s thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by G. Raidl and M. Riedler
PDF Cite
Optimization Approaches for Recreational Bicycle Tour Planning
April 2015, Master’s thesis, TU Wien, Institute of Computer Graphics and Algorithms.
Note: supervised by M. Prandtstetter and G. Raidl
PDF Cite
Exact Approaches for Network Design Problems with Relays
2015, Technical report AC-TR-15-003, Algorithms and Complexity Group, TU Wien.
PDF Cite
Optimization Challenges of the Future Federated Internet
October 2013, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~R.~Raidl and K.~Tutschku
PDF Cite
An Optimization Model for Integrated Timetable Based Design of Railway Infrastructure
Proceedings of the 5th International Seminar on Railway Operations Modelling and Analysis – RailCopenhagen~2013, pages 765-774, 2013, IAROR.
PDF Cite
Stabilizing Branch-and-Price for Constrained Tree Problems
Networks, volume 61, number 2, pages 150-170, 2013.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/leitner-11e.pdf
Cite
Using Optimized Virtual Network Embedding for Network Dimensioning
Proceedings of Networked Systems 2013, pages 118-125, 2013, IEEE.
PDF Cite
Hybrid Metaheuristics and Matheuristics for Problems in Bioinformatics and Transportation
May 2012, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~R.~Raidl and K.~F.~Dörner
PDF Cite