A General Scheme for Multiple Lower Bound Computation in Constraint Optimization

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 cost-effective producing significant time savings and is competitive against specialized algorithms for Max-CSP.

[1]  Prakash P. Shenoy,et al.  Binary join trees for computing marginals in the Shenoy-Shafer architecture , 1997, Int. J. Approx. Reason..

[2]  Bernard A. Nadel,et al.  Tree search and ARC consistency in constraint satisfaction algorithms , 1988 .

[3]  Thomas Schiex,et al.  Maintaining Reversible DAC for Max-CSP , 1999, Artif. Intell..

[4]  Stefan Arnborg,et al.  Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey , 1985, BIT.

[5]  Javier Larrosa,et al.  Partial Lazy Forward Checking for MAX-CSP , 1998, European Conference on Artificial Intelligence.

[6]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[7]  Javier Larrosa.  On the Time Complexity of Bucket Elimination Algorithms , 2000 .

[8]  Francesca Rossi,et al.  Constraint Propagation for Soft Constraints: Generalization and Termination Conditions , 2000, CP.

[9]  Thomas Schiex,et al.  Russian Doll Search for Solving Constraint Optimization Problems , 1996, AAAI/IAAI, Vol. 1.

[10]  Kalev Kask.  New Search Heuristics for Max-CSP , 2000, CP.

[11]  Christian Bessiere,et al.  MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems , 1996, CP.

[12]  Dan Geiger,et al.  A sufficiently fast algorithm for finding close to optimal junction trees , 1996, UAI.

[13]  Christian Bessiere,et al.  Some Practicable Filtering Techniques for the Constraint Satisfaction Problem , 1997, IJCAI.

[14]  Georg Gottlob,et al.  A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.

[15]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[16]  Peter van Beek,et al.  Local and Global Relational Consistency , 1995, Theor. Comput. Sci..

[17]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[18]  Rina Dechter,et al.  A general scheme for automatic generation of search heuristics from specification dependencies , 2001, Artif. Intell..

[19]  Rina Dechter,et al.  A Scheme for Approximating Probabilistic Inference , 1997, UAI.

[20]  Rina Dechter,et al.  Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..

[21]  Rina Dechter,et al.  Tree Clustering for Constraint Networks , 1989, Artif. Intell..