• Home
  • History
  • Annotate
Name Date Size #Lines LOC

..31-Jan-2020-

doc/H03-May-2022-15,04413,180

doxydoc/H31-Jan-2020-1,5201,088

examples/H31-Jan-2020-1,163633

experimental/H31-Jan-2020-9,4107,117

src/H31-Jan-2020-46,50534,191

test/H03-May-2022-1,3191,011

AUTHORSH A D31-Jan-2020978 2520

INSTALLH A D31-Jan-20201.9 KiB5540

LICENSEH A D31-Jan-202011 KiB8844

Makefile.amH A D31-Jan-20203.4 KiB11961

Makefile.inH A D31-Jan-202034.9 KiB1,028863

READMEH A D31-Jan-20202.2 KiB6842

bonmin-uninstalled.pc.inH A D31-Jan-2020662 119

bonmin.pc.inH A D31-Jan-2020339 1311

config.guessH A D31-Jan-202043.5 KiB1,5171,305

config.subH A D31-Jan-202032 KiB1,6271,483

configureH A D31-Jan-2020880 KiB26,90221,057

configure.acH A D31-Jan-20207.8 KiB204161

depcompH A D31-Jan-202015.6 KiB531330

install-shH A D31-Jan-20209 KiB324189

ltmain.shH A D31-Jan-2020191.8 KiB6,8645,416

missingH A D31-Jan-202010.8 KiB361268

README

1README file for Bonmin
2
3Bonmin (Basic Open-source Nonlinear Mixed INteger programming) is an
4open-source code for solving general MINLP (Mixed Integer NonLinear
5Programming) problems.
6
7It is distributed on COIN-OR (www.coin-or.org) under the EPL (Eclipse Public
8License). The EPL is a license approved by the OSI (Open Source
9Initiative), thus Bonmin is OSI Certified Open Source Software.
10
11Bonmin features several algorithms
12 - B-BB is a NLP-based branch-and-bound algorithm,
13 - B-OA is an outer-approximation decomposition algorithm,
14 - B-QG is an implementation of  Quesada and Grossmann's branch-and-cut
15 algorithm,
16 - B-Hyb is a hybrid outer-approximation based branch-and-cut algorithm.
17
18
19Bonmin documentation consists of a users' manual and a refernece
20manual they may be found on-line at the project web-site or can be built
21from the project source distribution. Instructions are provided in the
22INSTALL file.
23
24
25BONMIN MAINTAINER : Pierre Bonami (contact at pbonami@andrew.cmu.edu)
26
27
28BONMIN WEB-PAGE : https://projects.coin-or.org/Bonmin
29
30
31BONMIN MAILING LIST : http://list.coin-or.org/mailman/listinfo/bonmin
32
33
34For obtaining support, reporting bug, requesting feature you should
35write to the mailing-list (or if it does not exists yet to the project
36maintainer).
37
38
39For contributing code you should either contact the project maintainer
40or write to the mailing list. You will find legal requirement here :
41http://www.coin-or.org/contributions.html#contributions.
42
43
44
45This project was initiated in 2004 by IBM and Carnegie Mellon University
46as part of a joint effort to study algorithm for MINLP.
47
48You may find additional informations on at
49http://egon.cheme.cmu.edu/ibm/page.htm.
50In partivular
51 - A publicly available library of test instances of Convex MINLPs,
52 - Research papers on new algorithmic procedures for MINLP.
53
54
55DEPENDENCIES : Bonmin depends on the following external software : -
56COIN-OR software : CoinUtils, Cbc, Cgl, Clp, Ipopt
57- Others : blas, lapck, HSL.
58
59EXTERNAL RESSOURCES : COIN-OR : www.coin-or.org Eclipse Public License :
60http://www.opensource.org/licenses/cpl.php
61
62IBM-CMU Open Source MINLP web page :
63http://egon.cheme.cmu.edu/ibm/page.htm
64
65Bonmin is available on NEOS :
66http://www-neos.mcs.anl.gov/
67
68