Couenne
Couenne (Convex Over and Under ENvelopes for
Nonlinear Estimation) is a spatial branch & bound
algorithm that implements linearization, bound
reduction, and branching techniques for
Mixed-integer, Nonlinear Programming (MINLP)
problems. The purpose of Couenne is to find global
optima of nonconvex MINLPs.
A branch-and-bound algorithm for mixed integer nonlinear programming problems.
Pietro Belotti
https://github.com/coin-or/Couenne
Eclipse Public License 1.0
http://www.opensource.org/licenses/eclipse-1.0
BuildTools
CoinUtils
Cgl
Osi
Clp
Ipopt
Bonmin
Cbc
Ampl Solver Library
http://www.netlib.org/ampl/solvers
Optional
Blas
http://www.netlib.org/blas
Required (any implementation)
Lapack
http://www.netlib.org/lapack
Optional (any implementation)
At least one sparse linear solver (Mumps or MA27)
Required
C++
Active
3
Linux
gcc
Microsoft Windows
CYGWIN/gcc
Optimization deterministic nonlinear nonconvex mixed-integer
http://www.coin-or.org/Doxygen/Couenne/index.html
http://www.coin-or.org/download/source/Couenne
http://www.coin-or.org/download/binary/Couenne
http://list.coin-or.org/mailman/listinfo/couenne