Pages that link to "Item:Q1270766"

The following pages link to On the dimension of projected polyhedra (Q1270766):

Displaying 21 items.

• On the mixing set with a knapsack constraint (Q291057) (← links)
• Projecting systems of linear inequalities with binary variables (Q646699) (← links)
• Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
• Compact formulations as a union of polyhedra (Q927156) (← links)
• Minimum stabbing rectangular partitions of rectilinear polygons (Q1652208) (← links)
• Arc-based integer programming formulations for three variants of proportional symbol maps (Q1751132) (← links)
• Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570) (← links)
• Relating single-scenario facets to the convex hull of the extensive form of a stochastic single-node flow polytope (Q2183218) (← links)
• Quasi-Monte Carlo methods for two-stage stochastic mixed-integer programs (Q2235151) (← links)
• On the structure of linear programs with overlapping cardinality constraints (Q2297664) (← links)
• The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
• A polyhedral approach for a constrained quadratic 0-1 problem (Q2387431) (← links)
• On mixing sets arising in chance-constrained programming (Q2429465) (← links)
• Description of 2-integer continuous knapsack polyhedra (Q2506817) (← links)
• Facets and valid inequalities for the time-dependent travelling salesman problem (Q2514741) (← links)
• Polyhedral description of the integer single node flow set with constant bounds (Q2583130) (← links)
• A compact formulation of a mixed-integer set (Q2786320) (← links)
• An integer programming approach for the time-dependent TSP (Q2883581) (← links)
• On the minimum cut separator problem (Q2892143) (← links)
• On the cycle polytope of a directed graph and its relaxations (Q3057102) (← links)
• The <i>st</i>-bond polytope on series-parallel graphs (Q4611490) (← links)