The basic algorithm for pseudo-Boolean programming revisited
Authors:
- Yves CramaYCYves Crama
- Pierre HansenPHPierre Hansen
- Brigitte JaumardBJBrigitte Jaumard
- 1 December 1990
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 29 (2-3) , 171-185
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Linear time algorithms for NP-hard problems restricted to partial k-treesDiscrete Applied Mathematics, 1989
- Probabilistic satisfiabilityJournal of Complexity, 1988
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Unimodular functionsDiscrete Applied Mathematics, 1986
- A solvable case of quadratic 0–1 programmingDiscrete Applied Mathematics, 1986
- Nonlinear 0–1 programming: II. Dominance relations and algorithmsMathematical Programming, 1984
- Nonlinear 0–1 programming: I. Linearization techniquesMathematical Programming, 1984
- Technical Note—Generalized Covering Relaxation for 0-1 ProgramsOperations Research, 1980
- An Extension of Lawler and Bell's Method of Discrete Optimization with Examples from Capital BudgetingManagement Science, 1968
- A Method for Solving Discrete Optimization ProblemsOperations Research, 1966