4 citations · 5 across the 12 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2025
An Expansion-Based Approach for Quantified Integer Programming
Michael Hartisch, Leroy Chew
Quantified Integer Programming (QIP) bridges multiple domains by extending Quantified Boolean Formulas (QBF) to incorporate general integer variables and linear constraints while a…
cs.DM2018★ 4 cited
Game Tree Search in a Robust Multistage Optimization Framework: Exploiting Pruning Mechanisms
Michael Hartisch, Ulf Lorenz
We investigate pruning in search trees of so-called quantified integer linear programs (QIPs). QIPs consist of a set of linear inequalities and a minimax objective function, where…