Pages that link to "Item:Q1214165"

The following pages link to On defining sets of vertices of the hypercube by linear inequalities (Q1214165):

Displaying 31 items.

• The projected faces property and polyhedral relations (Q263204) (← links)
• Cardinality constrained combinatorial optimization: complexity and polyhedra (Q429646) (← links)
• The threshold order of a Boolean function (Q805595) (← links)
• Influence decision models: from cooperative game theory to social network analysis (Q826316) (← links)
• Lower bounds on the sizes of integer programs without additional variables (Q896270) (← links)
• Approximating polyhedra with sparse inequalities (Q896289) (← links)
• Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
• On relaxation methods for systems of linear inequalities (Q1159953) (← links)
• Expressing combinatorial optimization problems by linear programs (Q1186549) (← links)
• Integer programming formulation of combinatorial optimization problems (Q1239086) (← links)
• The value function of a mixed integer program. II (Q1258688) (← links)
• Interval measures of power (Q1280086) (← links)
• The dimension for the European Union Council under the Nice rules. (Q1429939) (← links)
• Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix (Q1646575) (← links)
• Sphere coverings of the hypercube with incomparable centers (Q1813996) (← links)
• On data classification by iterative linear partitioning (Q1885803) (← links)
• Simple games and magic squares (Q1894010) (← links)
• Strong IP formulations need large coefficients (Q2019425) (← links)
• The trouble with the second quantifier (Q2044549) (← links)
• Computational aspects of relaxation complexity (Q2061898) (← links)
• Complexity of linear relaxations in integer programming (Q2149550) (← links)
• Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570) (← links)
• Parity polytopes and binarization (Q2283103) (← links)
• Polyhedral results for position-based scheduling of chains on a single machine (Q2288972) (← links)
• Dimension of complete simple games with minimum (Q2470114) (← links)
• Cooperation through social influence (Q2630248) (← links)
• Computational aspects of relaxation complexity: possibilities and limitations (Q2689831) (← links)
• A complete classification of equational classes of threshold functions included in clones (Q5247685) (← links)
• Efficient MIP techniques for computing the relaxation complexity (Q6095738) (← links)
• The role of rationality in integer-programming relaxations (Q6126664) (← links)
• On the extension complexity of polytopes separating subsets of the Boolean cube (Q6156096) (← links)