BCP Implementation

BCP provides a framework for doing branch, cut and price. The user is responsible for describing the structure of the application to be solved, as well as, routines for doing variable and/or cut generation.

In order to implement a branch and price algorithm using BCP, there are a minimal set of functions that must be written by the user. In the following section we will describe each of these functions as they have been used in the AAP_BP example. The application source code is divided into the following directories:

• LP: methods used by the linear programming process,
• TM: methods used by the tree manager,
• Member: miscellaneous or common methods shared by processes,
• include: the source header files,
• Data: some data instances for AAP,
• Run: a run directory which includes a sample parameter file.