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

&
Artificial Intelligence 173 (16-17):1457-1491 (2009)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2009.07.003

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,867

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Memory intensive AND/OR search for combinatorial optimization in graphical models.Radu Marinescu & Rina Dechter - 2009 - Artificial Intelligence 173 (16-17):1492-1524.
Cut-and-solve: An iterative search strategy for combinatorial optimization problems.Sharlee Climer & Weixiong Zhang - 2006 - Artificial Intelligence 170 (8-9):714-738.
AND/OR search spaces for graphical models.Rina Dechter & Robert Mateescu - 2007 - Artificial Intelligence 171 (2-3):73-106.
A general branch and bound formulation for understanding and synthesizing and/or tree search procedures.Vipin Kumar & Laveen N. Kanal - 1983 - Artificial Intelligence 21 (1-2):179-198.
Importance sampling-based estimation over AND/OR search spaces for graphical models.Vibhav Gogate & Rina Dechter - 2012 - Artificial Intelligence 184-185 (C):38-77.
Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems.Joseph C. Pemberton & Weixiong Zhang - 1996 - Artificial Intelligence 81 (1-2):297-325.
Refining the phase transition in combinatorial search.Tad Hogg - 1996 - Artificial Intelligence 81 (1-2):127-154.
Variable neighborhood search for graphical model energy minimization.Abdelkader Ouali, David Allouche, Simon de Givry, Samir Loudni, Yahia Lebbah, Lakhdar Loukil & Patrice Boizumault - 2020 - Artificial Intelligence 278 (C):103194.
General Branch and Bound, and its relation to A∗ and AO∗.Dana S. Nau, Vipin Kumar & Laveen Kanal - 1984 - Artificial Intelligence 23 (1):29-58.
Unifying tree decompositions for reasoning in graphical models.Kalev Kask, Rina Dechter, Javier Larrosa & Avi Dechter - 2005 - Artificial Intelligence 166 (1-2):165-193.

Analytics

Added to PP
2020-12-22

Downloads
12 (#1,091,966)

6 months
8 (#506,113)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Partial constraint satisfaction.Eugene C. Freuder & Richard J. Wallace - 1992 - Artificial Intelligence 58 (1-3):21-70.
Bucket elimination: A unifying framework for reasoning.Rina Dechter - 1999 - Artificial Intelligence 113 (1-2):41-85.

View all 11 references / Add more references