A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
Rina Dechter, Kalev Kask, Javier Larrosa
Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of lower bounds to all singleton tuples, since it permits domain pruning in Branch and Bound algorithms. In this paper we introduce MCTE(z ), a general algorithm which allows the computation of lower bounds to arbitrary sets of tasks. Its time and accuracy grows as a function of z allowing a controlled tradeoff between lower bound accuracy and time and space to fit available resources. Subsequently, a specialization of MCTE(z ) called MBTE(z) is tailored to computing lower bounds to singleton tuples. Preliminary experiments on Max-CSP show that using MBTE(z) to guide dynamic variable and value orderings in branch and bound yields a dramatic reduction in the search space and, for some classes of problems, this reduction is highly costeffective producing signifiant time savings and is competative against specialized algorithms for Max-CSP.

PostScript | PDF