Pages that link to "Item:Q5108220"
From MaRDI portal
The following pages link to A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220):
Displaying 8 items.
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570) (← links)
- Balas formulation for the union of polytopes is optimal (Q2297650) (← links)
- Piecewise polyhedral formulations for a multilinear term (Q2661606) (← links)
- Mixed-Integer Convex Representability (Q5076722) (← links)
- Modeling combinatorial disjunctive constraints via junction trees (Q6120845) (← links)
- Piecewise linear trees as surrogate models for system design and planning under high-frequency temporal variability (Q6554650) (← links)
- MIP relaxations in factorable programming (Q6601201) (← links)
- Facet separation for disjunctive constraints with network flow representation (Q6644361) (← links)
