Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models

AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the structure of the model, which can translate into exponential time savings for search algorithms. Since the variable selection can have a dramatic impact on search performance when solving optimization tasks, we introduce in this paper a new dynamic AND/OR Branch-and-Bound algorithmic framework which accommodates variable ordering heuristics. The efficiency of the dynamic AND/OR approach is demonstrated empirically in a variety of domains.

[1]  Simon de Givry,et al.  Existential arc consistency: Getting closer to full arc consistency in weighted CSPs , 2005, IJCAI.

[2]  Javier Larrosa,et al.  Pseudo-tree Search with Soft Constraints , 2002, ECAI.

[4]  Daniel P. Miranker,et al.  On the Space-Time Trade-off in Solving Constraint Satisfaction Problems , 1995, IJCAI.

[5]  T. Koopmans,et al.  Activity Analysis of Production and Allocation. , 1952 .

[6]  Vipin Kumar,et al.  Search in Artificial Intelligence , 1988, Symbolic Computation.

[7]  Gérard Verfaillie,et al.  Earth Observation Satellite Management , 1999, Constraints.

[8]  Jegou Philippe,et al.  Decomposition and good recording for solving Max-CSPs , 2004 .

[9]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[10]  Laveen N. Kanal.  Book review: Search in Artificial Intelligence Ed. by Laveen Kanal and Vipin Kumar (Springer-Verlag, New York, 1988) , 1991, SGAR.

[11]  Philippe Jégou,et al.  Decomposition and Good Recording for Solving Max-CSPs , 2004, ECAI.

[12]  Rina Dechter,et al.  Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search Space , 2004, UAI.

[13]  Roberto J. Bayardo,et al.  Counting Models Using Connected Components , 2000, AAAI/IAAI.

[14]  Javier Larrosa,et al.  A General Scheme for Multiple Lower Bound Computation in Constraint Optimization , 2001, CP.

[15]  Simon de Givry,et al.  Radio Link Frequency Assignment , 1999, Constraints.

[16]  Adnan Darwiche,et al.  A Structure-Based Variable Ordering Heuristic for SAT , 2003, IJCAI.

[17]  Rina Dechter,et al.  AND/OR Branch-and-Bound for Graphical Models , 2005, IJCAI.

[18]  Michael J. Quinn,et al.  Taking Advantage of Stable Sets of Variables in Constraint Satisfaction Problems , 1985, IJCAI.

[19]  Peter van Beek,et al.  Guiding real-world SAT solving with dynamic hypergraph separator decomposition , 2004, 16th IEEE International Conference on Tools with Artificial Intelligence.

[20]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .