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