• CD Laboratory for Artificial Intelligence and Optimization for Planning and Scheduling
  2017 – 2024 / Christian Doppler Research Association (CDG) / Publications: 143666, 144274, 145912, 145932, 145933, 146062, 146064, 148760, 148767, 148780, 148786, 148794, 151216, 151217, 153181, 153183, 28044, 59343, 59414, 61264, 61269, 61270, 61364, 61366, 61367, 61667, 61668, 61669, 61671, 61673, 61675, 62088, 62136, 62379, 62380, 62381, 62382, 62386, 62387, 91681, 91858

Note: Due to the rollout of TU Wien’s new publication database, the list below may be slightly outdated. Once the migration is complete, everything will be up to date again.

• 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
• 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
• 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 Procedia Computer Science (pp. 517–524). Elsevier. https://doi.org/10.1016/j.procs.2021.01.270
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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
• 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 Lecture Notes in Computer Science (pp. 506–518). LNCS. https://doi.org/10.1007/978-3-319-72926-8_42

Note: Due to the rollout of TU Wien’s new publication database, the list below may be slightly outdated. Once the migration is complete, everything will be up to date again.

• 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