On defining sets of vertices of the hypercube by linear inequalities
From MaRDI portal
Publication:1214165
DOI10.1016/0012-365X(75)90003-5zbMath0297.52009OpenAlexW1994799860MaRDI QIDQ1214165
Publication date: 1975
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(75)90003-5
Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Mathematical programming (90C99)
Related Items
Influence decision models: from cooperative game theory to social network analysis, On data classification by iterative linear partitioning, Cooperation through social influence, Simple games and magic squares, Complexity of linear relaxations in integer programming, Ideal, non-extended formulations for disjunctive constraints admitting a network representation, Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix, Estimating the efficiency of threshold representations of Boolean functions, Representations of Boolean functions by systems of linear inequalities, Efficient MIP techniques for computing the relaxation complexity, Lower bounds on the sizes of integer programs without additional variables, Approximating polyhedra with sparse inequalities, The role of rationality in integer-programming relaxations, Forms of representation for simple games: sizes, conversions and equivalences, On the extension complexity of polytopes separating subsets of the Boolean cube, Computational aspects of relaxation complexity: possibilities and limitations, Sublinear Bounds for a Quantitative Doignon--Bell--Scarf Theorem, Cardinality constrained combinatorial optimization: complexity and polyhedra, On relaxation methods for systems of linear inequalities, The dimension for the European Union Council under the Nice rules., Expressing combinatorial optimization problems by linear programs, Dimension of complete simple games with minimum, Extended formulations in combinatorial optimization, Extended formulations in combinatorial optimization, Strong IP formulations need large coefficients, A note about games-composition dimension, Integer programming formulation of combinatorial optimization problems, Parity polytopes and binarization, Minimal inequalities, Polyhedral results for position-based scheduling of chains on a single machine, The trouble with the second quantifier, The value function of a mixed integer program. II, Sphere coverings of the hypercube with incomparable centers, Computational aspects of relaxation complexity, Interval measures of power, Semidefinite Descriptions of the Convex Hull of Rotation Matrices, A complete classification of equational classes of threshold functions included in clones, The threshold order of a Boolean function, The projected faces property and polyhedral relations
Cites Work
