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. Pietro Belotti (belotti at lehigh dot edu) https://projects.coin-or.org/Couenne Common Public License 1.0 http://www.opensource.org/licenses/cpl1.0.php BuildTools CoinUtils Cgl Osi Clp Ipopt Bonmin Cbc C++ 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 Active 3 0.2 0.2.0 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