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 by one developer
with decreasing Y-O-Y commits -
...
took an estimated 23 years of effort (COCOMO model)
starting with its first commit in July, 2006
ending with its most recent commit 4 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...
-
...
Black Duck offers a free trial so you can discover if there are open source vulnerabilities in your code
-
...
data presented on the Open Hub is available through our API
-
...
in 2016, 47% of companies did not have formal process in place to track OS code
-
...
check out hot projects on the Open Hub
30 Day SummaryJan 24 2019 — Feb 23 2019
|
12 Month SummaryFeb 23 2018 — Feb 23 2019
|
