default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Hartisch
Person information
- affiliation: FAU Erlangen, Germany
- affiliation (former): Universität Siegen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[e2]Michael Hartisch
, Chu-Hsuan Hsueh, Jonathan Schaeffer:
Computers and Games - 12th International Conference, CG 2024, Virtual Event, November 25-29, 2024, Revised Selected Papers. Lecture Notes in Computer Science 15550, Springer 2025, ISBN 978-3-031-86584-8 [contents]- 2024
- [j7]Werner Baak, Marc Goerigk, Michael Hartisch:
A preference elicitation approach for the ordered weighted averaging criterion using solution choice observations. Eur. J. Oper. Res. 314(3): 1098-1110 (2024) - [c13]Kevin-Martin Aigner, Marc Goerigk, Michael Hartisch, Frauke Liers, Arthur Miehlich:
A Framework for Data-Driven Explainability in Mathematical Optimization. AAAI 2024: 20912-20920 - [e1]Michael Hartisch, Chu-Hsuan Hsueh, Jonathan Schaeffer:
Advances in Computer Games - 18th International Conference, ACG 2023, Virtual Event, November 28-30, 2023, Revised Selected Papers. Lecture Notes in Computer Science 14528, Springer 2024, ISBN 978-3-031-54967-0 [contents] - [i8]Marc Goerigk, Michael Hartisch, Sebastian Merten, Kartikey Sharma:
Feature-Based Interpretable Surrogates for Optimization. CoRR abs/2409.01869 (2024) - [i7]Marc Goerigk, Michael Hartisch, Sebastian Merten:
Towards Robust Interpretable Surrogates for Optimization. CoRR abs/2412.01264 (2024) - 2023
- [j6]Marc Goerigk, Michael Hartisch:
Combinatorial optimization problems with balanced regret. Discret. Appl. Math. 328: 40-59 (2023) - [j5]Marc Goerigk, Michael Hartisch:
A framework for inherently interpretable optimization models. Eur. J. Oper. Res. 310(3): 1312-1324 (2023) - [j4]Michael Hartisch, Chu-Hsuan Hsueh, Jonathan Schaeffer:
Advances in Computer Games (ACG 2023) conference report. J. Int. Comput. Games Assoc. 45(4): 105-108 (2023) - [c12]Ingo Althöfer, Michael Hartisch, Thomas Zipproth:
Analysis of a Collatz Game and Other Variants of the 3n+1 Problem. ACG 2023: 123-132 - [i6]Kevin-Martin Aigner, Marc Goerigk, Michael Hartisch, Frauke Liers, Arthur Miehlich:
A Framework for Data-Driven Explainability in Mathematical Optimization. CoRR abs/2308.08309 (2023) - 2022
- [i5]Marc Goerigk, Michael Hartisch:
A Framework for Inherently Interpretable Optimization Models. CoRR abs/2208.12570 (2022) - [i4]Michael Hartisch, Ulf Lorenz:
A general model-and-run solver for multistage robust discrete linear optimization. CoRR abs/2210.11132 (2022) - 2021
- [j3]Marc Goerigk, Michael Hartisch:
Multistage robust discrete optimization via quantified integer programming. Comput. Oper. Res. 135: 105434 (2021) - [c11]Tobias Marx, Michael Hartisch:
Robust Multistage Yard Crane Scheduling in Container Terminals. OR 2021: 268-273 - [c10]Michael Hartisch:
Adaptive Relaxations for Multistage Robust Optimization. PRICAI (1) 2021: 485-499 - [i3]Michael Hartisch:
Adaptive Relaxations for Multistage Robust Optimization. CoRR abs/2106.12858 (2021) - [i2]Marc Goerigk, Michael Hartisch:
Combinatorial Optimization Problems with Balanced Regret. CoRR abs/2111.12470 (2021)
2010 – 2019
- 2019
- [c9]Michael Hartisch, Ulf Lorenz:
A Novel Application for Game Tree Search - Exploiting Pruning Mechanisms for Quantified Integer Programs. ACG 2019: 66-78 - [c8]Michael Hartisch, Ulf Lorenz:
Robust Multistage Optimization with Decision-Dependent Uncertainty. OR 2019: 439-445 - [c7]Christian Reintjes, Michael Hartisch, Ulf Lorenz:
Support-Free Lattice Structures for Extrusion-Based Additive Manufacturing Processes via Mixed-Integer Programming. OR 2019: 465-471 - [c6]Jonas B. Weber, Michael Hartisch, Ulf Lorenz:
Optimized Design of Thermofluid Systems Using the Example of Mold Cooling in Injection Molding. OR 2019: 473-480 - [c5]Michael Hartisch, Ulf Lorenz:
Mastering Uncertainty: Towards Robust Multistage Optimization with Decision Dependent Uncertainty. PRICAI (1) 2019: 446-458 - 2018
- [c4]Christian Reintjes, Michael Hartisch, Ulf Lorenz:
Design and Optimization for Additive Manufacturing of Cellular Structures Using Linear Optimization. OR 2018: 371-377 - [i1]Michael Hartisch, Ulf Lorenz:
Game Tree Search in a Robust Multistage Optimization Framework: Exploiting Pruning Mechanisms. CoRR abs/1811.12146 (2018) - 2017
- [c3]Thorsten Ederer, Michael Hartisch, Ulf Lorenz, Thomas Opfer, Jan Wolf:
Yasol: An Open Source Solver for Quantified Mixed Integer Programs. ACG 2017: 224-233 - [c2]Christian Reintjes, Michael Hartisch, Ulf Lorenz:
Lattice Structure Design with Linear Optimization for Additive Manufacturing as an Initial Design in the Field of Generative Design. OR 2017: 451-457 - 2016
- [c1]Michael Hartisch, Thorsten Ederer, Ulf Lorenz, Jan Wolf:
Quantified Integer Programs with Polyhedral Uncertainty Set. Computers and Games 2016: 156-166 - 2015
- [j2]Michael 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) - [j1]Michael Hartisch, Ingo Althöfer:
Optimal Robot Play in Certain Chess Endgame Situations. J. Int. Comput. Games Assoc. 38(3): 180-185 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-21 00:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
