swMATH15630MaRDI QIDQ27518FDOQ27518
Author name not available (Why is that?)
Official website: http://link.springer.com/article/10.1007/s10898-015-0322-3
Cited In (51)
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Using projected cutting planes in the extended cutting plane method
- Reformulating the disjunctive cut generating linear program
- Two linear approximation algorithms for convex mixed integer nonlinear programming
- MDPLIB
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- Conflict Analysis for MINLP
- Outer approximation for integer nonlinear programs via decision diagrams
- On decomposition and multiobjective-based column and disjunctive cut generation for MINLP
- Reformulations for utilizing separability when solving convex MINLP problems
- A proximal-point outer approximation algorithm
- Preprocessing and cutting planes with conflict graphs
- Using regularization and second order information in outer approximation for convex MINLP
- The supporting hyperplane optimization toolkit for convex MINLP
- On the approximation of unbounded convex sets by polyhedra
- A disjunctive cut strengthening technique for convex MINLP
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
- MINLP
- AlphaECP
- DICOPT
- Pyomo
- MINLPLib
- LINDOGlobal
- MINOTAUR
- Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
- MacMINLP
- RAPTOR
- PAVER
- BENSOLVE
- Algorithm 748
- PySCIPOpt
- On solving generalized convex MINLP problems using supporting hyperplane techniques
- EXAMINER
- OPTIMA
- Juniper
- extended-MIQCP
- Decogo
- Muriqui
- SUSPECT
- GreedyBB
- Preface to the special issue dedicated to the 6th world congress on global optimization held in Metz, France, July 8--10, 2019
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
- FrankWolfe.jl
- A choice-based optimization approach for contracting in supply chains
- MindtPy
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- COPT
- Alternative regularizations for outer-approximation algorithms for convex MINLP
- Generating feasible points for mixed-integer convex optimization problems by inner parallel cuts
- Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
This page was built for software: SHOT
