The basic algorithm for pseudo-Boolean programming revisited

Yves Crama, Pierre Hansen, Brigitte Jaumard
1990 Discrete Applied Mathematics  
The basic algorithm of pseudo-Boolean programming due to Hammer and Rudeanu allows to minimize nonlinear O-l functions by recursively eliminating one variable at each iteration. We show it has linear-time complexity when applied to functions associated in a natural way with graphs of bounded tree-width. We also propose a new approach to the elimination of a variable based on a branch-and-bound scheme, which allows shortcuts in Boolean manipulations. Computational results are reported on.
doi:10.1016/0166-218x(90)90142-y fatcat:uuflgi7ixrf43na537kgcbisfq