Projecting systems of linear inequalities with binary variables
From MaRDI portal
Publication:646699
Recommendations
- Generalized resolution for 0--1 linear inequalities
- scientific article; zbMATH DE number 1801377
- Projection with a minimal system of inequalities
- Variable Elimination for Disequations in Generalized Linear Constraint Systems
- Solution of parametrized linear inequalities by Fourier elimination and its applications
Cites work
- scientific article; zbMATH DE number 408798 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A simplification for some disjunctive formulations
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Disjunctive Programming
- Fourier-Motzkin elimination extension to integer programming problems
- Generalized resolution for 0--1 linear inequalities
- On the convex hull of the union of certain polyhedra
- On the dimension of projected polyhedra
- Production Planning by Mixed Integer Programming
- Representation for multiple right-hand sides
- Some results and experiments in programming techniques for propositional logic
- Subset Algebra Lift Operators for 0-1 Integer Programming
- The Problem of Simplifying Truth Functions
- The perfectly matchable subgraph polytope of a bipartite graph
- The perfectly matchable subgraph polytope of an arbitrary graph
Cited in
(3)
This page was built for publication: Projecting systems of linear inequalities with binary variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646699)
