bc-opt: A Branch-and-Cut Code for Mixed Integer Programs.

A branch-and-cut mixed integer programming system, called bc-opt, is described, incorporating most of the valid inequalities that have been used or suggested for such systems, namely lifted 0-1 knpsack inequalities, 0-1 gub knapsack and integer knapsack inequalities, flow-cover and continuous knapsack inequalities, path inequalities for fixed charge network flow structure and Gomory mixed integer cuts. The principal development is a set of interfacce routines allowing these cut routines to generate cuts for new subsets of aggregations of constraints.