Pages that link to "Item:Q2942683"
From MaRDI portal
The following pages link to Algorithmic Approach for Improved Mixed-Integer Reformulations of Convex Generalized Disjunctive Programs (Q2942683):
Displaying 5 items.
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques (Q506439) (← links)
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints (Q1753130) (← links)
- Between steps: intermediate relaxations between big-M and convex hull formulations (Q2117230) (← links)
- Cutting Plane Algorithm for Convex Generalized Disjunctive Programs (Q3186647) (← links)
