Pages that link to "Item:Q927156"
From MaRDI portal
The following pages link to Compact formulations as a union of polyhedra (Q927156):
Displaying 22 items.
- Mixing polyhedra with two non divisible coefficients (Q715089) (← links)
- Single item lot-sizing with non-decreasing capacities (Q847825) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- The mixing set with divisible capacities: a simple approach (Q1043241) (← links)
- Tight formulations for some simple mixed integer programs and convex objective integer programs (Q1424279) (← links)
- Closed-form expressions for uniform polyhedra and their duals (Q1597677) (← links)
- Convex hull results for generalizations of the constant capacity single node flow set (Q2020609) (← links)
- Between steps: intermediate relaxations between big-M and convex hull formulations (Q2117230) (← links)
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570) (← links)
- A geometric way to build strong mixed-integer programming formulations (Q2294389) (← links)
- Balas formulation for the union of polytopes is optimal (Q2297650) (← links)
- Small and strong formulations for unions of convex sets from the Cayley embedding (Q2316612) (← links)
- On mixing sets arising in chance-constrained programming (Q2429465) (← links)
- A compact formulation of a mixed-integer set (Q2786320) (← links)
- Mixed integer linear programming formulation techniques (Q2808240) (← links)
- On the minimum cut separator problem (Q2892143) (← links)
- Covering Linear Programming with Violations (Q2940540) (← links)
- The Mixing Set with Divisible Capacities (Q3503864) (← links)
- Extended formulations in combinatorial optimization (Q5900907) (← links)
- Extended formulations in combinatorial optimization (Q5919994) (← links)
- Stable compactifications of polyhedra (Q5954529) (← links)
- Polyhedral compactifications. I (Q6176266) (← links)
