CBC stands for Coin Branch and Cut. It is a COIN-OR module from which one can build a branch-and-cut based solver for mixed integer linear programs. It has cutting planes from the Cgl, uses a varient of strong branching, has a primal heuristic. It uses the Coin Clp solver to solve the linear programs at each node. The code is still a work in progress, but it can solve many MILP instances.
For information on Cbc, to find out what all of the above acronyms and terms mean, and to learn how to become involved in the COIN-OR initiative, please visit the COIN-OR web page
One command per line (and no -) abcd? gives list of possibilities, if only one + explanation abcd?? adds explanation, if only one fuller help(LATER) abcd without value (where expected) gives current value abcd value or abcd = value sets value
? dualT(olerance) primalT(olerance) inf(easibilityWeight) integerT(olerance) inc(rement) allow(ableGap) ratio(Gap) fix(OnDj) tighten(Factor) log(Level) slog(Level) maxN(odes) strong(Branching) direction error(sAllowed) gomory(Cuts) probing(Cuts) knapsack(Cuts) oddhole(Cuts) clique(Cuts) round(ingHeuristic) cost(Strategy) keepN(ames) scaling directory solver import export save(Model) restore(Model) presolve initialS(olve) branch(AndBound) sol(ution) max(imize) min(imize) time(Limit) exit stop quit - stdin unitTest miplib ver(sion)
This NEOS solver executes on a Debian Linux workstation.
DOE disclaimer DOE Web privacy policy