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.
Commercial Use
Modify
Distribute
Sub-License
Use Patent Claims
Hold Liable
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.
At one point, Open Hub analyzed source code for this project based on code location(s) available at that time. Since then, the code locations have been removed.
30 Day SummaryMar 23 2022 — Apr 22 2022
|
12 Month SummaryApr 22 2021 — Apr 22 2022
|