=ADD=
=reftype=
14
=number=
01-11
=url=
ftp://ftp.risc.uni-linz.ac.at/pub/techreports/2001/01-11.ps.gz
=year=
2001
=month=
04
=author=
Ratschan; Stefan
=title=
Search Heuristics for Box Decomposition Methods
=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.
=sponsor=
FWF SFB1303
=keywords=
Heuristics, optimization, quantified constraints