The following pages link to Disjunctive Programming (Q3565239):
Displaying 6 items.
- Structured learning modulo theories (Q511777) (← links)
- A strong duality theorem for the minimum of a family of convex programs (Q1131953) (← links)
- Global optimization of disjunctive programs (Q1679482) (← links)
- Constraint qualification failure in action (Q1694785) (← links)
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
- A branch and cut algorithm for minimum spanning trees under conflict constraints (Q2257077) (← links)
