AND/OR Branch-and-Bound search for combinatorial optimization in graphical models

Artificial Intelligence

Volumn 173, Issue 16-17, 2009, Pages 1457-1491

  Marinescu, Radu ^a   Dechter, Rina ^b  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b Ringgold Standard Institution Informatics   (United States)

Author keywords

AND OR search; Bayesian networks; Constraint networks; Constraint optimization; Decomposition; Graphical models; Search

Indexed keywords

AND/OR SEARCH; CONSTRAINT NETWORKS; CONSTRAINT OPTIMIZATION; GRAPHICAL MODELS; SEARCH;

COMBINATORIAL OPTIMIZATION; CONSTRAINED OPTIMIZATION; DISTRIBUTED PARAMETER NETWORKS; ELECTRIC LOAD SHEDDING; GRAPHIC METHODS; INFERENCE ENGINES; INTELLIGENT NETWORKS; LEARNING ALGORITHMS; SPEECH RECOGNITION;

BAYESIAN NETWORKS;

EID: 69249213986     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2009.07.003     Document Type: Article

References (74)

1. Dechter R., and Mateescu R. AND/OR search spaces for graphical models. Artificial Intelligence 171 1 (2007) 73-106
2. E. Freuder, M. Quinn, Taking advantage of stable sets of variables in constraint satisfaction problems, in: International Joint Conference on Artificial Intelligence (IJCAI-1985), 1985, pp. 1076-1078
3. R. Bayardo, D. Miranker, On the space-time trade-off in solving constraint satisfaction problems, in: International Joint Conference on Artificial Intelligence (IJCAI-1995), 1995, pp. 558-562
4. Dechter R., and Rish I. Mini-buckets: A general scheme for approximating inference. Journal of ACM 2 50 (2003) 107-153
5. Kask K., and Dechter R. A general scheme for automatic generation of search heuristics from specification dependencies. Artificial Intelligence 129 1-2 (2001) 91-131
6. Pearl J. Probabilistic Reasoning in Intelligent Systems (1988), Morgan Kaufmann
7. Bistarelli S., Montanari U., and Rossi F. Semiring based constraint solving and optimization. Journal of ACM 44 2 (1997) 309-315
8. Nilsson N.J. Principles of Artificial Intelligence (1980), Tioga
9. Kask K., Dechter R., Larrosa J., and Dechter A. Unifying cluster-tree decompositions for reasoning in graphical models. Artificial Intelligence 166 1-2 (2005) 225-275
10. S. Minton, M.D. Johnston, A.B. Philips, P. Laired, Solving large scale constraint satisfaction and scheduling problems using heuristic repair methods, in: National Conference on Artificial Intelligence (AAAI-1990), 1990, pp. 17-24
11. B. Selman, H. Levesque, D. Mitchell, A new method for solving hard satisfiability problems, in: National Conference on Artificial Intelligence (AAAI-1992), 1992, pp. 440-446
12. R. Wallace, Analysis of heuristic methods for partial constraint satisfaction problems, in: Principles and Practice of Constraint Programming (CP-1996), 1996, pp. 482-496
13. Freuder E., and Wallace R. Partial constraint satisfaction. Artificial Intelligence 58 1-3 (1992) 21-70
14. G. Verfaillie, M. Lemaitre, T. Schiex, Russian doll search for solving constraint optimization problems, in: National Conference on Artificial Intelligence (AAAI), 1996, pp. 298-304
15. J. Larrosa, P. Meseguer, Partition-based lower bound for MAX-CSP, in: Principles and Practice of Constraint Programming (CP-1999), 1999, pp. 303-315
16. J. Larrosa, T. Schiex, In the quest of the best form of local consistency for weighted CSPs, in: National Conference of Artificial Intelligence (AAAI-2003), 2003, pp. 631-637
17. Larrosa J., and Schiex T. Solving weighted CSP by maintaining arc consistency. Artificial Intelligence 159 1-2 (2004) 1-26
18. S. de Givry, F. Heras, J. Larrosa, M. Zytnicki, Existential arc consistency: Getting closer to full arc consistency in weighted CSPs, in: International Joint Conference in Artificial Intelligence (IJCAI-2005), 2005, pp. 84-89
19. Shenoy P., and Shafer G. Propagating belief functions with local computations. IEEE Expert 4 1 (1986) 43-52
20. Jensen F.V., Lauritzen S., and Olesen K. Bayesian updating in recursive graphical models by local computation. Computational Statistics Quarterly 4 1 (1990) 269-282
21. Dechter R. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence 113 1-2 (1999) 41-85
22. Peng Y., and Reggia J.A. A connectionist model for diagnostic problem solving. IEEE Transactions on Systems, Man and Cybernetics (1989)
23. K. Kask, R. Dechter, Stochastic local search for Bayesian networks, in: Workshop on AI and Statistics (AI-STAT-1999), 1999, pp. 113-122
24. J. Park, Using weighted MAX-SAT engines to solve MPE, in: National Conference of Artificial Intelligence (AAAI-2002), 2002, pp. 682-687
25. F. Hutter, H. Hoos, T. Stutzle, Efficient stochastic local search for MPE solving, in: International Joint Conference on Artificial Intelligence (IJCAI-2005), 2005, pp. 169-174
26. S.E. Shimony, E. Charniak, A new algorithm for finding MAP assignments to belief networks, in: Uncertainty in Artificial Intelligence (UAI-1991), 1991, pp. 185-193
27. E. Santos, On the generation of alternative explanations with implications for belief revision, in: Uncertainty in Artificial Intelligence (UAI-1991), 1991, pp. 339-347
28. Z. Li, B. DAmbrosio, An efficient approach for finding the MPE in belief networks, in: Uncertainty in Artificial Intelligence (UAI-1993), 1993, pp. 342-349
29. B.K. Sy, Reasoning MPE to multiply connected belief networks using message-passing, in: National Conference of Artificial Intelligence (AAAI-1992), 1992, pp. 570-576
30. R. Marinescu, K. Kask, R. Dechter, Systematic vs non-systematic algorithms for solving the MPE task, in: Uncertainty in Artificial Intelligence (UAI-2003), 2003, pp. 394-402
31. A. Choi, M. Chavira, A. Darwiche, Node splitting: A scheme for generating upper bounds in Bayesian networks, in: Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence (UAI), 2007, pp. 57-66
32. Lawler E., and Wood D. Branch-and-bound methods: A survey. Operations Research 14 4 (1966) 699-719
33. R. Dechter, K. Kask, J. Larrosa, A general scheme for multiple lower bound computation in constraint optimization, in: Principles and Practice of Constraint Programming (CP), 2001, pp. 346-360
34. Pearl J. Heuristics: Intelligent Search Strategies for Computer Problem Solving (1984), Addison-Wesley
35. Kanal L., and Kumar V. Search in Artificial Intelligence (1988), Springer-Verlag
36. Cooper M., and Schiex T. Arc consistency for soft constraints. Artificial Intelligence 154 1-2 (2003) 199-227
37. Dechter R. Constraint Processing (2003), MIT Press
38. Haralick R., and Elliot G. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14 3 (1980) 263-313
39. C. Bessiere, J.-C. Regin, MAC and combined heuristics: two reasons to forsake FC (and CBJ) on hard problems, in: Principles and Practice of Constraint Programming (CP-1996), 1996, pp. 61-75
40. Brelaz D. New method to color the vertices of a graph. Communications of the ACM 4 22 (1979) 251-256
41. C. Lecoutre, F. Boussemart, F. Hemery, L. Sais, Boosting systematic search by weighting constraints, in: European Conference on Artificial Intelligence (ECAI-2004), 2004, pp. 146-150
42. C. Lecoutre, F. Boussemart, F. Hemery, Backjump-based techniques versus conflict directed heuristics, in: International Conference on Tools with Artificial Intelligence (ICTAI-2004), 2004, pp. 549-557
43. J. Huang, A. Darwiche, A structure-based variable ordering heuristic, in: International Joint Conference on Artificial Intelligence (IJCAI-2003), 2003, pp. 1167-1172
44. W. Li, P. van Beek, Guiding real-world SAT solving with dynamic hypergraph separator decomposition, in: International Conference on Tools with Artificial Intelligence (ICTAI-2004), 2004, pp. 542-548
45. R. Bayardo, J.D. Pehoushek, Counting models using connected components, in: National Conference of Artificial Intelligence (AAAI-2000), 2000, pp. 157-162
46. T. Sang, P. Beame, H. Kautz, A dynamic approach to MPE and weighted MAX-SAT, in: International Joint Conference on Artificial Intelligence (IJCAI-2007), 2007, pp. 549-557
47. R. Marinescu, AND/OR search strategies for combinatorial optimization in graphical models, PhD thesis, University of California, Irvine, 2008
48. R. Marinescu, R. Dechter, AND/OR branch-and-bound search for combinatorial optimization in graphical models, Technical report, University of California, Irvine, 2008
49. Darwiche A. Recursive conditioning. Artificial Intelligence 126 1-2 (2001) 5-41
50. H. Bodlaender, J. Gilbert, Approximating treewidth, pathwidth and minimum elimination tree-height, Technical report, Utrecht University, 1991
51. U. Kjæaerulff, Triangulation of graph-based algorithms giving small total space, Technical report, University of Aalborg, Denmark, 1990
52. T. Sang, P. Beame, H. Kautz, Solving Bayesian networks by weighted model counting, in: National Conference of Artificial Intelligence (AAAI-2005), 2005, pp. 475-482
53. Ott J. Analysis of Human Genetic Linkage (1999), The Johns Hopkins University Press
54. M. Fishelson, D. Geiger, Exact genetic linkage computations for general pedigrees, in: International Conference on Intelligent Systems for Molecular Biology, 2002, pp. 189-198
55. Fishelson M., Dovgolevsky N., and Geiger D. Maximum likelihood haplotyping for general pedigrees. Human Heredity 59 1 (2005) 41-60
56. R. Dechter, D. Larkin, Hybrid processing of beliefs and constraints, in: Uncertainty in Artificial Intelligence (UAI-2001), 2001, pp. 112-119
57. D. Larkin, R. Dechter, Bayesian inference in the presence of determinism, in: Artificial Intelligence and Statistics (AISTAT-2003), 2003
58. D. Allen, A. Darwiche, New advances in inference using recursive conditioning, in: Uncertainty in Artificial Intelligence (UAI-2003), 2003, pp. 2-10
59. R. Dechter, R. Mateescu, Mixtures of deterministic-probabilistic networks, in: Uncertainty in Artificial Intelligence (UAI), 2004, pp. 120-129
60. Rish I., and Dechter R. Resolution vs. search: Two strategies for SAT. Journal of Automated Reasoning 24 1-2 (2000) 225-275
61. T. Walsh, SAT vs CSP, in: Principles and Practice of Constraint Programming (CP), 2000, pp. 441-456
62. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik, Chaff: Engineering an efficient SAT solver, in: Design Automation Conference (DAC-2001), 2001
63. Bensana E., Lemaitre M., and Verfaillie G. Earth observation satellite management. Constraints 4 3 (1999) 293-299
64. Chavira M., Darwiche A., and Jaeger M. Compiling relational Bayesian networks for exact inference. International Journal of Approximate Reasoning 42 1-2 (2006) 4-20
65. F. Bacchus, S. Dalmao, T. Pittasi, Value elimination: Bayesian inference via backtracking search, in: Uncertainty in Artificial Intelligence (UAI-2003), 2003, pp. 20-28
66. J. Larrosa, P. Meseguer, M. Sanchez, Pseudo-tree search with soft constraints, in: European Conference on Artificial Intelligence (ECAI-2002), 2002, pp. 131-135
67. Dechter R. Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition. Artificial Intelligence 41 3 (1990) 273-312
68. Z. Collin, R. Dechter, S. Katz, On the feasibility of distributed constraint satisfaction, in: International Joint Conference on Artificial Intelligence (IJCAI-1991), 1991, pp. 318-324
69. P. Modi, W. Shen, M. Tambe, M. Yokoo, An asynchronous complete method for distributed constraint optimization, in: International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-2003), 2003, pp. 161-168
70. Modi P., Shen W., Tambe M., and Yokoo M. ADOPT: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence 161 1-2 (2005) 149-180
71. W. Yeoh, A. Felner, S. Koening, BnB-ADOPT: An asynchronous branch-and-bound DCOP algorithm, in: International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-2008), 2008, pp. 591-598
72. A. Petcu, B. Faltings, DPOP: A scalable method for multiagent constraint optimization, in: International Joint Conference on Artificial Intelligence (IJCAI-2005), 2005, pp. 266-271
73. P. Jegou, C. Terrioux, Decomposition and good recording for solving MAX-CSPs, in: European Conference on Artificial Intelligence (ECAI-2004), 2004, pp. 196-200
74. E. Rollon, J. Larrosa, Depth-first mini-bucket elimination, in: Principles and Practice of Constraint Programming (CP-2005), 2005, pp. 563-577