The COIN-OR Branch and Cut (Cbc) solver is an open-source mixed-integer
linear programming solver written in C++. Problems for Cbc can be submitted
on the NEOS server in AMPL, GAMS, or MPS format.
Cbc is intended to be used primarily as a callable library to create
customized branch-and-cut solvers, however, a basic stand-alone executable
is used to solve problems submitted to the NEOS Server.
Cbc utilizes other COIN-OR projects Cgl (Cut Generation Library) to generate
cutting planes and Cpl to solve the linear programs at each node of the tree.
Cbc was developed by John Forrest, now retired from IBM Research. The project
is currently managed by John Forrest and Ted Ralphs.
For more information on Cbc and the COIN-OR initiative, please visit the Cbc COIN-OR website.
The user must submit a model in AMPL
format. Examples are provided in the examples
section of the AMPL website.
The problem must be specified in a model file. A data file and commands
files may also be provided. If the commands file is specified, it must
contain the AMPL solve command; however, it must not contain
the model or data commands. The model and data
files are renamed internally by NEOS.