Pages that link to "Item:Q1742902"
From MaRDI portal
The following pages link to Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902):
Displaying 4 items.
- Between steps: intermediate relaxations between big-M and convex hull formulations (Q2117230) (← links)
- (Q5874501) (← links)
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones (Q6498414) (← links)
- Solving net-constrained clustering problem (Q6668165) (← links)