Matthias Horn, MSc

 

Institute of Computer Graphics and Algorithms 186/1
Faculty of Informatics
TU Wien
Room: HA0410
Favoritenstraße 9-11
1040 Vienna, Austria

email: horn@ac.tuwien.ac.at
phone: +43 1 58801 186132
web: personal homepage

 

 

Supervisor:
Günther Raidl

MSc (Computer Engineering)

Research area in the program
Combinatorial Optimization

Keywords

  • Vehicle Routing Problems
  • Mixed Integer Programming
  • Variable Neighborhood Search
  • Combinatorial Optimization

Research Interests

The research interests of Matthias Horn are centered around techniques to solve combinatorial optimization problems. In particular exact mathematical programming techniques and metaheuristic techniques such as mixed integer programming or variable neighborhood search, respectively. Early work included the vehicle routing problems with site-dependency constraints.

Scientific CV

Since 3.2017: PhD Student, TU Wien
4.2014 - 2.2017: BSc., Computer Engineering, TU Wien
10.2010 - 4.2014: MSc., Computer Engineering, TU Wien

[ Download CV ]

Publications

Submitted

Horn, M. & Raidl, G. (2019) Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem. Computer Aided System Theory - EUROCAST 2019, Lecture Notes on Computer Science.

Blum, C., Horn, M. & Raidl, G. (2019). Job Sequencing with One Common and Multiple Secondary Resources. An A*/Beam Search Based Anytime Algorithm. Artificial Intelligence.

Horn, M., Machler, J., Raidl, G. & Rönnberg, E. (2019) A*-Based Construction of Decision Diagrams for a Prize-Collecting Scheduling Problem. Computers & Operations Research.

Horn, M., Raidl, G. & Rönnberg, E. (2019) A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources. Annals of Operations Research.

Accepted/published

Horn, M. & Raidl, G. (2019). Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem. In: EUROCAST 2019 - Extended Abstracts of the Seventeenth International Conference on Computer Aided Systems Theory.

Horn, M., Raidl, G. & Blum, C. (2018). Job sequencing with one common and multiple secondary resources. A problem motivated from particle therapy for cancer treatments. In: Nicosia G., Pardalos P., Giuffrida G., Umeton R. (eds.) Machine Learning, Optimization, and Big Data. MOD 2017, 506-518.

Horn, M., Raidl, G. & Rönnberg, E. (2018). An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows. In: PATAT 2018. Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling, 235-256.