Anytime AND/OR depth-first search for combinatorial optimization
Lars Otten, Rina Dechter · AI Communications · 2012
One popular and efficient scheme for solving combinatorial optimization problems over graphical models exactly is depth-first Branch and Bound. However, when the algorithm exploits problem decomposition using AND/OR search spaces, its anytime behavio