Game Tree Search in a Robust Multistage Optimization Framework: Exploiting Pruning Mechanisms
@article{Hartisch2018GameTS, title={Game Tree Search in a Robust Multistage Optimization Framework: Exploiting Pruning Mechanisms}, author={Michael Hartisch and Ulf Lorenz}, journal={ArXiv}, year={2018}, volume={abs/1811.12146} }
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 some variables are existentially and others are universally quantified. They can be interpreted as two-person zero-sum games between an existential and a universal player on the one hand, or multistage optimization problems under uncertainty on the other hand. Solutions are so-called winning strategies for the… CONTINUE READING
One Citation
References
SHOWING 1-10 OF 41 REFERENCES
Solving multistage quantified linear optimization problems with the alpha–beta nested Benders decomposition
- Mathematics, Computer Science
- EURO J. Comput. Optim.
- 2015
- 7
Backjumping for Quantified Boolean Logic satisfiability
- Computer Science, Mathematics
- Artif. Intell.
- 2001
- 99
- Highly Influential
- PDF
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation
- Computer Science
- Journal of Automated Reasoning
- 2004
- 139
- Highly Influential