Pages that link to "Item:Q2149570"
From MaRDI portal
The following pages link to Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570):
Displaying 7 items.
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
- A geometric way to build strong mixed-integer programming formulations (Q2294389) (← links)
- Small and strong formulations for unions of convex sets from the Cayley embedding (Q2316612) (← links)
- A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)
- Modeling combinatorial disjunctive constraints via junction trees (Q6120845) (← links)
- Piecewise polyhedral relaxations of multilinear optimization (Q6622747) (← links)
- Facet separation for disjunctive constraints with network flow representation (Q6644361) (← links)