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
    1 Citations
    Multistage Robust Combinatorial Optimization via Quantified Integer Programming
    • PDF

    References

    SHOWING 1-10 OF 41 REFERENCES
    Solving multistage quantified linear optimization problems with the alpha–beta nested Benders decomposition
    • 7
    Multistage Optimization with the Help of Quantified Linear Programming
    • 2
    Yasol: An Open Source Solver for Quantified Mixed Integer Programs
    • 5
    Quantified Linear Programs: A Computational Study
    • 10
    Exploiting Graph Properties of Game Trees
    • 51
    • PDF
    Analyzing Selected Quantified Integer Programs
    • 14
    Game tree algorithms and solution trees
    • 14
    • PDF
    A Minimax Algorithm Better than Alpha-Beta?
    • 200
    • PDF
    Backjumping for Quantified Boolean Logic satisfiability
    • 99
    • Highly Influential
    • PDF
    An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation
    • 139
    • Highly Influential