Decogo

swMATH32747MaRDI QIDQ44458FDOQ44458

Author name not available (Why is that?)

Described by source

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

Cited In (9)

• Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
• On decomposition and multiobjective-based column and disjunctive cut generation for MINLP
• The supporting hyperplane optimization toolkit for convex MINLP
• A disjunctive cut strengthening technique for convex MINLP
• 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
• 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

This page was built for software: Decogo