The basic algorithm for pseudo-Boolean programming revisited

Discrete Applied Mathematics

Volumn 29, Issue 2-3, 1990, Pages 171-185

  Crama, Yves ^a   Hansen, Pierre ^b   Jaumard, Brigitte ^c  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b RUTGERS UNIVERSITY   (United States)

^c GERAD   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38249018098     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(90)90142-Y     Document Type: Article

References (21)

1. Complexity of finding embeddings in a k-tree
2. Linear time algorithms for NP-hard problems restricted to partial k-trees
3. Nonlinear 0–1 programming: I. Linearization techniques
4. Nonlinear 0–1 programming: II. Dominance relations and algorithms
5. A solvable case of quadratic 0–1 programming
6. Probabilistic satisfiability
7. Generalized covering relaxation for 0–1 programs
8. On the determination of the minima of pseudo-Boolean functions
9. Application of discrete linear programming to the minimization of Boolean functions
10. Programmes mathématiques en variables 0–1
11. Les procédures d'optimisation et d'exploitation par séparation et évaluation
12. Unimodular functions
13. The Art of Computer Programming
14. A method for solving discrete optimization problems
15. An extension of Lawler and Bell's method of discrete optimization with examples from capital budgeting
16. Graph minors: II. Algorithmic aspect of tree-width
17. A Balasian-based algorithm for zero-one polynomial programming
18. Further improvements in the polynomial zero-one algorithm