Generalized resolution for 0--1 linear inequalities
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4053069 (Why is no real title available?)
- A Way to Simplify Truth Functions
- Coefficient reduction for inequalities in 0–1 variables
- Edmonds polytopes and a hierarchy of combinatorial problems
- Input Proofs and Rank One Cutting Planes
- Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- The Problem of Simplifying Truth Functions
- The complexity of theorem-proving procedures
- The intractability of resolution
Cited in
(15)- Many-valued logic and mixed integer programming
- Projection, consistency, and George Boole
- A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem
- Resolution vs. cutting plane solution of inference problems: Some computational experience
- Logic cuts for processing networks with fixed charges
- Completeness of cutting planes revisited
- scientific article; zbMATH DE number 516985 (Why is no real title available?)
- Non-clausal redundancy properties
- Mixed logical-linear programming
- Projecting systems of linear inequalities with binary variables
- Achieving consistency with cutting planes
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- Logic cuts for multilevel generalized assignment problems.
- Conflict Resolution
- Simplifying clausal satisfiability problems
This page was built for publication: Generalized resolution for 0--1 linear inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1354004)
