Pages that link to "Item:Q3186647"
From MaRDI portal
The following pages link to Cutting Plane Algorithm for Convex Generalized Disjunctive Programs (Q3186647):
Displaying 6 items.
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints (Q1753130) (← links)
- A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development (Q2138322) (← links)
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function (Q2181606) (← links)
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs (Q2274851) (← links)
- Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
