Version 2 (modified by pbonami, 13 years ago) (diff) |
---|

## Welcomme to the Bonmin homepage

Bonmin (Basic Open-source Nonlinear Mixed INteger programming) is an open-source code for solving general MINLP (Mixed Integer NonLinear? Programming) problems.

It is distributed on COINOR (www.coin-or.org) under the CPL (Common Public License). The CPL is a license approved by the OSI (Open Source Initiative), thus Bonmin is OSI Certified Open Source Software.

Bonmin features several algorithms

- B-BB is a NLP-based branch-and-bound algorithm,

- B-OA is an outer-approximation decomposition algorithm,

- B-QG is an implementation of Quesada and Grossmann's branch-and-cut algorithm,

- B-Hyb is a hybrid outer-approximation based branch-and-cut algorithm.

*As all Wiki pages, this page is editable, this means that you can
modify the contents of this page simply by using your
web-browser. Simply click on the "Edit this page" link at the bottom
of the page. WikiFormatting will give you a detailed description of
available Wiki formatting commands.*