Corpus ID: 53974460

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}
}

Michael Hartisch, Ulf Lorenz

Published 2018

Mathematics, Computer Science

ArXiv

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

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed