Decogo

swMATH32747MaRDI QIDQ44458

No author found.

Described by source

• Decomposition-based inner- and outer-refinement algorithms for global optimization

Related Items (9)

Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT ⋮ A disjunctive cut strengthening technique for convex MINLP ⋮ On decomposition and multiobjective-based column and disjunctive cut generation for MINLP ⋮ The supporting hyperplane optimization toolkit for convex MINLP ⋮ The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming ⋮ Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes ⋮ Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization ⋮ Partially distributed outer approximation ⋮ Branch-and-price for a class of nonconvex mixed-integer nonlinear programs

This page was built for software: Decogo