Pages that link to "Item:Q2294389"
From MaRDI portal
The following pages link to A geometric way to build strong mixed-integer programming formulations (Q2294389):
Displaying 7 items.
- Ideal, non-extended formulations for disjunctive constraints admitting a network representation (Q2149570) (← links)
- Small and strong formulations for unions of convex sets from the Cayley embedding (Q2316612) (← links)
- Incremental and encoding formulations for mixed integer programming (Q2450751) (← links)
- Stronger formulations of mixed integer linear programs: an example (Q4378103) (← links)
- A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)
- Strong mixed-integer formulations for the floor layout problem (Q5882271) (← links)
- Facet separation for disjunctive constraints with network flow representation (Q6644361) (← links)