Version 2 (modified by pbelotti, 12 years ago) (diff)


Couenne, an exact solver for nonconvex MINLPs

Couenne is an experimental implementation of a spatial branch&bound algorithm that uses the Couenne cut generation library; the purpose of the spatial branch&bound is to find global optima of nonconvex MINLPs.

The Couenne (Convex Over- and Under ENvelopes for Nonlinear Estimation) library contains methods for bound reduction, branching, and linearization cuts for Mixed-integer, non-convex Programming problems. It comprises:

  • an expression library;
  • separation of linearization cuts;
  • branching rules;
  • bound tightening methods.

It is distributed on Coin-OR ( under the CPL (Common Public License). The CPL is a license approved by the OSI (Open Source Initiative), thus Couenne is OSI Certified Open Source Software.

Download, installation and usage

Note: For now we refer to an old version of Couenne. Instruction on how to obtain the new Couenne will be posted soon.

svn co Bonmin-trunk

See also Bonmin's download and installation instructions. Please make sure to add the option


when running the configure script. Once Bonmin is correctly configured and built, BonCouenne? is run as follows:

Bonmin/experimental/NotConvex/boncouenne <>

specifying a stub (.nl) as an input. Stub files can be generated from AMPL, for instance.

You may specify a set of options to tweak the performance of BonCouenne?.

Couenne is maintained by Pietro Belotti (belotti@…).

Web page:

This project was initiated in 2004 by IBM and Carnegie Mellon University as part of a joint effort to develop algorithms for MINLP. You may find additional info (a publicly available library of test instances of Convex MINLPs and papers on MINLP) at

For contributing code you should either contact the project maintainer or write to the mailing list. You can find legal requirement at

Dependencies: CoinUtils?, Cbc, Cgl, Clp, Ipopt, Osi (from Coin-OR), ASL (Ampl Solver Library, see

External resources: Coin-OR, Common Public License.