• E-Mail: michael.hartisch@fau.de

About me

I studied mathematics at the Friedrich Schiller University Jena, and received my PhD (Dr. rer. nat.) from the University of Siegen in 2020. After working as a research assistant at the chair of Technology Management at the University of Siegen I joined the Network and Data Science Management group of Marc Goerigk as a post-doc in 2021. I held the deputy professorship of the chair of Network and Data Science Management from April 2023 until March 2024, before I moved on to FAU Erlangen in April 2024.

Research interest

• (multistage) robust optimization
• optimization under decision-dependent uncertainty 
• explorable uncertainty
• technical operations research
• explainable and interpretable optimization

Related links 

• my google scholar profile 
  • https://scholar.google.de/citations?user=ls1CT8AAAAAJ&hl=de&oi=ao
• Yasol: Solver for Multistage Robust Discrete Optimization 
  • http://www.q-mip.org
• my orcid profile
  • https://orcid.org/0000-0001-6304-4973

Publications

Published Papers

• K.M. Aigner, M. Goerigk, M. Hartisch, F. Liers, A. Miehlich. A Framework for Data-Driven Explainability in Mathematical Optimization. Proceedings of the AAAI Conference on Artificial Intelligence, 38(19), 20912-20920, 2024. [paper][preprint]
• I. Althöfer, M. Hartisch, T. Zipproth. Analysis of a Collatz Game and Other Variants of the Problem. In: Hartisch, M., Hsueh, CH., Schaeffer, J. (eds) Advances in Computer Games. ACG 2023. Lecture Notes in Computer Science, vol 14528. Springer, Cham, 2024. [paper]
• M. Goerigk, M. Hartisch. A Framework for Inherently Interpretable Optimization Models. European Journal of Operational Research, 310(3):1312-1324, 2023. [paper][preprint]
• W. Baak, M. Goerigk, M. Hartisch. A Preference Elicitation Approach for the Ordered Weighted Averaging Criterion using Solution Choice Observations. European Journal of Operational Research, in print, 2023. [paper][preprint]
• M. Goerigk, M. Hartisch. Combinatorial Optimization Problems with Balanced Regret. Discrete Applied Mathematics, 328:40-59, 2023. [paper][preprint]
• T. Marx, M. Hartisch. Robust Multistage Yard Crane Scheduling in Container Terminals. In Operations Research Proceedings 2021, pages 268-273. Springer, 2022. [ paper ]
• M. Goerigk, M. Hartisch. Multistage Robust Combinatorial Optimization via Quantified Integer Programming. Computers & Operations Research. 135:105434, 2021. [paper][preprint]
• M. Hartisch. Adaptive Relaxations for Multistage Robust Optimization. PRICAI 2021: Trends in Artificial Intelligence: 18th Pacific Rim International Conference on Artificial Intelligence, Cham, 2021. [paper | preprint]
• M. Hartisch, C. Reintjes, T. Marx, and U. Lorenz. Robust topology optimization of truss-like space structures. In P. F. Pelz and P. Groche, editors, Uncertainty in Mechanical Engineering, pages 296-306, Cham, 2021. [ paper ]
• C. Reintjes, J. Reuter, M. Hartisch, U. Lorenz, and B. Engel. Towards cad-based mathematical optimization for additive manufacturing -- designing forming tools for tool-bound bending. In P. F. Pelz and P. Groche, editors, Uncertainty in Mechanical Engineering, pages 12-22, Cham, 2021. [ paper ]
• M. Goerigk and M. Hartisch. Multistage Robust Discrete Optimization via Quantified Integer Programming. Computers & Operations Research, 135:105434, 2021. [ paper ]
• M. Hartisch. Quantified Integer Programming with Polyhedral and Decision-Dependent Uncertainty. PhD thesis, University of Siegen, Germany, 2020. [ paper ]
• J. B. Weber, M. Hartisch, A. D. Herbst, and U. Lorenz. Towards an algorithmic synthesis of thermofluid systems. Optimization and Engineering, 22:587-642, 2021. [ paper ]
• M. Hartisch and U. Lorenz. A Novel Application for Game Tree Search - Exploiting Pruning Mechanisms for Quantified Integer Programs. In T. Cazenave, J. van den Herik, A. Saffidine, and I.-C. Wu, editors, 16th International Conference on Advances in Computer Games, ACG 2019, pages 66-78, Cham, 2020. [ paper ]
• M. Hartisch and U. Lorenz. Robust multistage optimization with decision-dependent uncertainty. In Operations Research Proceedings 2019, pages 439-445. Springer, 2020. [ paper ]
• C. Reintjes, M. Hartisch, and U. Lorenz. Support-free lattice structures for extrusion-based additive manufacturing processes via mixed-integer programming. In Operations Research Proceedings 2019, pages 465-471. Springer, 2020. [ paper ]
• J. B. Weber, M. Hartisch, and U. Lorenz. Optimized design of thermofluid systems using the example of mold cooling in injection molding. In Operations Research Proceedings 2019, pages 473-480. Springer, 2020. [ paper ]
• C. Reintjes, M. Hartisch, and U. Lorenz. Design and optimization for additive manufacturing of cellular structures using linear optimization. In Operations Research Proceedings 2018, pages 371-77. Springer, 2019. [ paper ]
• M. Hartisch and U. Lorenz. Mastering uncertainty: Towards robust multistage optimization with decision dependent uncertainty. In 16th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2019, pages 446-458. Springer, 2019. [ paper ]
• M. Hartisch, A. Herbst, U. Lorenz, and J. Weber. Towards resilient process networks-designing booster stations via quantified programming. In Applied Mechanics and Materials, volume 885, pages 199-210. Trans Tech Publ, 2018. [ paper ]
• C. Reintjes, M. Hartisch, and U. Lorenz. Lattice structure design with linear optimization for additive manufacturing as an initial design in the field of generative design. In Operations Research Proceedings 2017, pages 451-457. Springer, 2018. [ paper ]
• T. Ederer, M. Hartisch, U. Lorenz, T. Opfer, and J. Wolf. Yasol: An open source solver for quantified mixed integer programs. In 15th International Conference on Advances in Computer Games, ACG 2017, pages 224-233, 2017. [ paper ]
• M. Hartisch, T. Ederer, U. Lorenz, and J. Wolf. Quantified integer programs with polyhedral uncertainty set. In 9th International Conference on Computers and Games, CG 2016, pages 156--166, 2016. [ paper ]
• M. Hartisch. Impact of rounding during retrograde analysis for a game with chance nodes: Karl's race as a test case. J. Int. Comput. Games Assoc., 38(2):81-93, 2015. [ paper ]
• M. Hartisch and I. Althöfer. Optimal robot play in certain chess endgame situations. J. Int. Comput. Games Assoc., 38(3):180-185, 2015. [paper ]
• I. Althöfer and M. Hartisch. On the effects of biasing win conditions. Game and Puzzle Design, 1(1):50-55, 2015.