|The main objectives of this effort are:
||a new publicly available library of test instances of convex MINLPs
||a new software package bonmin that contains classical methods such as branch-and-bound and outer approximation, and a new family of hybrid algorithms of which branch-and-bound and outer-approximation are two extreme cases
||the new framework is open source and uses existing software in COIN-OR. In particular Clp, Cbc and Ipopt are used as building blocks.
||computational results on the new and other available libraries of test problems.