Generalized resolution for 0--1 linear inequalities
From MaRDI portal
Recommendations
Cites work
- A Way to Simplify Truth Functions
- Coefficient reduction for inequalities in 0–1 variables
- Edmonds polytopes and a hierarchy of combinatorial problems
- scientific article; zbMATH DE number 4053069 (Why is no real title available?)
- 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 complexity of theorem-proving procedures
- The intractability of resolution
- The Problem of Simplifying Truth Functions
Cited in
(19)- Resolution vs. cutting plane solution of inference problems: Some computational experience
- Logic cuts for processing networks with fixed charges
- Resolution and the integrality of satisfiability problems
- Branch-and-cut solution of inference problems in propositional logic
- Logic cuts for multilevel generalized assignment problems.
- Many-valued logic and mixed integer programming
- Mixed logical-linear programming
- Non-clausal redundancy properties
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- Consistency for \(0-1\) programming
- A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem
- Projection, consistency, and George Boole
- Achieving consistency with cutting planes
- Conflict Resolution
- scientific article; zbMATH DE number 516985 (Why is no real title available?)
- scientific article; zbMATH DE number 1114456 (Why is no real title available?)
- Simplifying clausal satisfiability problems
- Completeness of cutting planes revisited
- Projecting systems of linear inequalities with binary variables
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)
