Bonmin is an open source solver for mixed integer nonlinear programming. It is distributed through COIN-OR. It is also available on NEOS and in the commercial modeling language GAMS.

Bonmin was developed in a (continuing) collaboration between Carnegie Mellon University and IBM (IBM-CMU MINLP).

I took part in the development of Bonmin since its beginning and I am the project manager. More informations on the program can be found on Bonmin homepage:


CglLandP is an implementation of an efficient cut generator for lift-and-project cuts in COIN-OR. I developed the code in a collaboration with Professor Egon Balas at Carnegie Mellon University. It is available as part of the COIN-OR Cut Generation Library: