Generalized resolution for 0--1 linear inequalities
From MaRDI portal
Publication:1354004
DOI10.1007/BF01531033zbMath0955.68503MaRDI QIDQ1354004
Publication date: 13 May 1997
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
90C09: Boolean programming
Related Items
Logic cuts for processing networks with fixed charges, Logic cuts for multilevel generalized assignment problems., Many-valued logic and mixed integer programming, Mixed logical-linear programming
Cites Work
- Unnamed Item
- The intractability of resolution
- Edmonds polytopes and a hierarchy of combinatorial problems
- A Way to Simplify Truth Functions
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- Input Proofs and Rank One Cutting Planes
- Coefficient reduction for inequalities in 0–1 variables
- The complexity of theorem-proving procedures
- The Problem of Simplifying Truth Functions