Pages that link to "Item:Q1756777"
From MaRDI portal
The following pages link to Decomposition-based inner- and outer-refinement algorithms for global optimization (Q1756777):
Displaying 12 items.
- Decogo (Q44458) (← links)
- A DE-based scatter search for global optimization problems (Q1723280) (← links)
- Partially distributed outer approximation (Q2046262) (← links)
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← 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)
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming (Q2173514) (← links)
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes (Q2696926) (← links)
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization (Q3296380) (← links)
- A column generation algorithm for solving energy system planning problems (Q6159482) (← links)