Project Summary
Bonmin (Basic Open-source Nonlinear Mixed INteger programming) is an experimental open-source C++ code for solving general MINLP (Mixed Integer NonLinear Programming) problems of the form:
min f(x)
s.t. g_L R, g(x): R^n --> R^m are twice continuously differentiable functions and I is a subset of {1,..,n}.
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.
In a Nutshell, Bonmin...
- ...
- ...
-
...
has a well established, mature codebase
maintained by a small development team
with increasing Y-O-Y commits -
...
took an estimated 20 years of effort (COCOMO model)
starting with its first commit in July, 2006
ending with its most recent commit 2 months ago
Quick Reference
Common Public License 1.0
Permitted
Commercial Use
Modify
Distribute
Sub-License
Use Patent Claims
Forbidden
Hold Liable
Required
Disclose Source
Include Copyright
Include License
These details are provided for information only. No information here is legal advice and should not be used as such.
This Project has No vulnerabilities Reported Against it
Did You Know...
-
...
there are over 3,000 projects on the Open Hub with security vulnerabilities reported against them
-
...
by exploring contributors within projects, you can view details on every commit they have made to that project
-
...
use of OSS increased in 65% of companies in 2016
-
...
you can subscribe to e-mail newsletters to receive update from the Open Hub blog
30 Day SummaryMay 2 2020 — Jun 1 2020
|
12 Month SummaryJun 1 2019 — Jun 1 2020
|
