Projecting systems of linear inequalities with binary variables
From MaRDI portal
Publication:646699
DOI10.1007/S10479-009-0623-3zbMATH Open1254.90116OpenAlexW2050199085MaRDI QIDQ646699FDOQ646699
Authors: E. Balas 
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
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
- Production Planning by Mixed Integer Programming
- Generalized resolution for 0--1 linear inequalities
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- 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
- Title not available (Why is that?)
- The Problem of Simplifying Truth Functions
- Disjunctive Programming
- A Computing Procedure for Quantification Theory
- On the dimension of projected polyhedra
- Some results and experiments in programming techniques for propositional logic
- The perfectly matchable subgraph polytope of a bipartite graph
- On the convex hull of the union of certain polyhedra
- Subset Algebra Lift Operators for 0-1 Integer Programming
- A simplification for some disjunctive formulations
- Representation for multiple right-hand sides
- The perfectly matchable subgraph polytope of an arbitrary graph
- Fourier-Motzkin elimination extension to integer programming problems
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)
