Projecting systems of linear inequalities with binary variables
From MaRDI portal
Publication:646699
DOI10.1007/s10479-009-0623-3zbMath1254.90116OpenAlexW2050199085MaRDI QIDQ646699
Publication date: 17 November 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0623-3
Related Items (1)
Cites Work
- Unnamed Item
- The perfectly matchable subgraph polytope of an arbitrary graph
- Some results and experiments in programming techniques for propositional logic
- A simplification for some disjunctive formulations
- On the convex hull of the union of certain polyhedra
- Fourier-Motzkin elimination extension to integer programming problems
- On the dimension of projected polyhedra
- Generalized resolution for 0--1 linear inequalities
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Representation for multiple right-hand sides
- The perfectly matchable subgraph polytope of a bipartite graph
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Disjunctive Programming
- Subset Algebra Lift Operators for 0-1 Integer Programming
- Production Planning by Mixed Integer Programming
- A Computing Procedure for Quantification Theory
- The Problem of Simplifying Truth Functions
This page was built for publication: Projecting systems of linear inequalities with binary variables
