On the dimension of projected polyhedra
From MaRDI portal
Publication:1270766
DOI10.1016/S0166-218X(98)00096-1zbMath0910.90234MaRDI QIDQ1270766
Publication date: 29 November 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)
Related Items (22)
An integer programming approach for the time-dependent TSP ⋮ On the minimum cut separator problem ⋮ On the mixing set with a knapsack constraint ⋮ Ideal, non-extended formulations for disjunctive constraints admitting a network representation ⋮ A polyhedral approach for a constrained quadratic 0-1 problem ⋮ Minimum stabbing rectangular partitions of rectilinear polygons ⋮ Relating single-scenario facets to the convex hull of the extensive form of a stochastic single-node flow polytope ⋮ On mixing sets arising in chance-constrained programming ⋮ The st-bond polytope on series-parallel graphs ⋮ Projecting systems of linear inequalities with binary variables ⋮ Compact formulations as a union of polyhedra ⋮ Unnamed Item ⋮ Quasi-Monte Carlo methods for two-stage stochastic mixed-integer programs ⋮ Arc-based integer programming formulations for three variants of proportional symbol maps ⋮ A compact formulation of a mixed-integer set ⋮ On the cycle polytope of a directed graph and its relaxations ⋮ Description of 2-integer continuous knapsack polyhedra ⋮ Facets and valid inequalities for the time-dependent travelling salesman problem ⋮ On the structure of linear programs with overlapping cardinality constraints ⋮ Polyhedral description of the integer single node flow set with constant bounds ⋮ The \(k\)-separator problem: polyhedra, complexity and approximation results ⋮ Projection, lifting and extended formulation integer and combinatorial optimization
Cites Work
This page was built for publication: On the dimension of projected polyhedra
