Abstract

In this paper we study search heuristics for box decomposition methods that solve problems such as global optimization, minimax optimization, or quantified constraint solving. For this we unify these methods as nested branch-and-bound algorithms, and develop a model that is more convenient for studying heuristics for these algorithms than the traditional models from Artificial Intelligence. We use the result to prove various theorems about heuristics and apply the outcome to the box decomposition methods under consideration. We support the findings with timings for the method of quantified constraint solving developed by the author.

Citations