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...
- ...
- ...
- ...
-
...
took an estimated 20 years of effort (COCOMO model)
starting with its first commit in July, 2006
ending with its most recent commit over 1 year 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...
-
...
nearly 1 in 3 companies have no process for identifying, tracking, or remediating known open source vulnerabilities
-
...
by exploring contributors within projects, you can view details on every commit they have made to that project
-
...
in 2016, 47% of companies did not have formal process in place to track OS code
-
...
compare projects before you chose one to use
30 Day SummaryJun 29 2021 — Jul 29 2021
|
12 Month SummaryJul 29 2020 — Jul 29 2021
|
