Generalized resolution for 0?1 linear inequalities
Author:
- 1 March 1992
- journal article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 6 (1-3) , 271-286
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Input Proofs and Rank One Cutting PlanesINFORMS Journal on Computing, 1989
- Generalized resolution and cutting planesAnnals of Operations Research, 1988
- A quantitative approach to logical inferenceDecision Support Systems, 1988
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning ModelsOperations Research, 1985
- The intractability of resolutionTheoretical Computer Science, 1985
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred VariablesOperations Research, 1981
- Coefficient reduction for inequalities in 0–1 variablesMathematical Programming, 1974
- Edmonds polytopes and a hierarchy of combinatorial problemsDiscrete Mathematics, 1973
- The complexity of theorem-proving procedures1971
- The Problem of Simplifying Truth FunctionsThe American Mathematical Monthly, 1952