Matthias Horn
Projektass. Dipl.-Ing. Dr.techn. / BSc
Role
-
PostDoc Researcher
Databases and Artificial Intelligence, E192-02
Projects
-
CD Laboratory for Artificial Intelligence and Optimization for Planning and Scheduling
2017 – 2024 / Christian Doppler Research Association (CDG)
Publications: 136808 / 139849 / 138379 / 138399 / 138400 / 138528 / 138530 / 144345 / 142199 / 142211 / 142210 / 142193 / 141227 / 141228 / 143220 / 143222 / 190688 / 191173 / 193566 / 192686 / 192678 / 24775 / 55565 / 55636 / 57470 / 57475 / 57476 / 57570 / 57572 / 57573 / 57872 / 57873 / 57874 / 57876 / 57878 / 57880 / 58293 / 58340 / 58583 / 58584 / 58585 / 58586 / 58590 / 58591 / 86907 / 87083
Publications
- Driver Shift Planning for an Online Store with Short Delivery Times / Horn, M., Frohner, N., & Raidl, G. R. (2021). Driver Shift Planning for an Online Store with Short Delivery Times. In Proceedings of the 2nd International Conference on Industry 4.0 and Smart Manufacturing (ISM 2020) (pp. 517–524). Elsevier. https://doi.org/10.1016/j.procs.2021.01.270
-
Advances in search techniques for combinatorial optimization: New anytime A* search and decision diagram based approaches
/
Horn, M. (2021). Advances in search techniques for combinatorial optimization: New anytime A* search and decision diagram based approaches [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.96303
Download: PDF (3.77 MB) - A$$^*$$-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem / Horn, M., & Raidl, G. R. (2021). A$$^*$$-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 72–88). LNCS / Springer. https://doi.org/10.1007/978-3-030-78230-6_5
- A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem / Kaufmann, T., Horn, M., & Raidl, G. R. (2020). A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem. In Parallel Problem Solving from Nature – PPSN XVI (pp. 385–398). LNCS / Springer. https://doi.org/10.1007/978-3-030-58115-2_27
- On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences / Horn, M., Djukanovic, M., Blum, C., & Raidl, G. R. (2020). On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. In Optimization and Applications (pp. 134–149). LNCS / Springer. https://doi.org/10.1007/978-3-030-62867-3_11
- Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines / Frohner, N., Horn, M., & Raidl, G. R. (2020). Route Duration Prediction in a Stochastic and Dynamic Vehicle Routing Problem with Short Delivery Deadlines. In Procedia Computer Science (pp. 366–370). Elsevier. https://doi.org/10.1016/j.procs.2021.01.175
- A*-based construction of decision diagrams for a prize-collecting scheduling problem / Horn, M., Maschler, J., Raidl, G. R., & Rönnberg, E. (2020). A*-based construction of decision diagrams for a prize-collecting scheduling problem. Computers and Operations Research, 126(105125), 105125. https://doi.org/10.1016/j.cor.2020.105125
- A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources / Horn, M., Raidl, G. R., & Rönnberg, E. (2020). A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources. Annals of Operations Research, 302(2), 477–505. https://doi.org/10.1007/s10479-020-03550-7
- On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences / Horn, M., Djukanovic, M., Blum, C., & Raidl, G. (2020). On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. CPAIOR 2020, Wien, Austria. http://hdl.handle.net/20.500.12708/87120
- A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem / Blum, C., Thiruvady, D., Ernst, A. T., Horn, M., & Raidl, G. R. (2019). A Biased Random Key Genetic Algorithm with Rollout Evaluations for the Resource Constraint Job Scheduling Problem. In AI 2019: Advances in Artificial Intelligence (pp. 549–560). LNCS. https://doi.org/10.1007/978-3-030-35288-2_44
- Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem / Horn, M., & Raidl, G. (2019). Decision Diagram Based Limited Discrepancy Search for a Job Sequencing Problem. In Computer Aided System Theory - EUROCAST 2019 (pp. 94–95). http://hdl.handle.net/20.500.12708/58004
- Job sequencing with one common and multiple secondary resources: An A∗/Beam Search based anytime algorithm / Horn, M., Raidl, G., & Blum, C. (2019). Job sequencing with one common and multiple secondary resources: An A∗/Beam Search based anytime algorithm. Artificial Intelligence, 277(103173), 103173. https://doi.org/10.1016/j.artint.2019.103173
- An A* Algorithm for Solving a Prize-Collecting Sequencing Problem with One Common and Multiple Secondary Resources and Time Windows / 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 Annals of Operations Research (pp. 235–256). Springer. http://hdl.handle.net/20.500.12708/57525
- Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment / Horn, M., Raidl, G., & Blum, C. (2017). Job Sequencing with One Common and Multiple Secondary Resources: A Problem Motivated from Particle Therapy for Cancer Treatment. In Machine Learning, Optimization, and Big Data Third International Conference, MOD 2017, Volterra, Italy, September 14–17, 2017, Revised Selected Papers (pp. 506–518). LNCS. https://doi.org/10.1007/978-3-319-72926-8_42
-
A heuristic framework for dynamic vehicle routing with site-dependent constraints
/
Horn, M. (2017). A heuristic framework for dynamic vehicle routing with site-dependent constraints [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2017.37527
Download: PDF (849 KB)
Supervisions
-
A Variable neighborhood search for the job sequencing with one common and multiple secondary resources problem
/
Kaufmann, T. (2019). A Variable neighborhood search for the job sequencing with one common and multiple secondary resources problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.59930
Download: PDF (5.46 MB)