CBC User Guide

By J. Forrest, R. Lougee-Heimer. 2005

181 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A Rewriting System for Convex Optimization Problems (2017, background): “Examples of solvers specialized to each class include GLPK (Makhorin, 2016) and CBC (Forrest & Lougee-Heimer, 2005) for linear programs; qpOASES (Ferreau, Kirches, Potschka, Bock, & Diehl, 2014) and OSQP (Banjac, Goulart, Stellato, & Boyd, 2017) for quadratic programs; ECOS (Dom-ahidi, Chu, & Boyd,…”
Integer programming techniques for the nurse rostering problem (2014, methodology): “This approach allowed us to deeply integrate our routines with the COIN-OR MIP solvers [24,41,32] and also communicate with commercial solvers through the Open Solver Interface (OSI)[40].”
VizLinter: A Linter and Fixer Framework for Data Visualization (2021, methodology): “BIP is an NP-Complete problem, whose solution can be found using the Branch-and-Cut algorithm [41] or various well-established solvers such as SCIP [3] and CBC [17].”
This paper is included in the Proceedings of the 16th USENIX Symposium on Operating Systems Design and Implementation. (unknown): “We formulate the cost minimization as an ILP and solve it optimally with an off-the-shelf solver [18].”