Pages that link to "Item:Q2173514"
From MaRDI portal
The following pages link to The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming (Q2173514):
Displaying 13 items.
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm (Q746812) (← links)
- Solving mixed integer nonlinear programs by outer approximation (Q1337138) (← links)
- Decomposition-based inner- and outer-refinement algorithms for global optimization (Q1756777) (← links)
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs (Q2010085) (← links)
- Partially distributed outer approximation (Q2046262) (← links)
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT (Q2124807) (← links)
- A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
- On decomposition and multiobjective-based column and disjunctive cut generation for MINLP (Q2129200) (← links)
- The supporting hyperplane optimization toolkit for convex MINLP (Q2162510) (← links)
- DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems (Q2302363) (← links)
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs (Q2967613) (← links)
- Fill‐rate service level constrained distribution network design (Q6060687) (← links)
- Distributed primal outer approximation algorithm for sparse convex programming with separable structures (Q6173959) (← links)
