This directory contains a sample implementation of the Cutting Stock
Problem using the BCP framework. 

For more details see the paper Laszlo Ladanyi, Jon Lee and Robin
Lougee-Heimer: "Rapid prototyping of optimization algorithms using
COIN-OR: A case study involving the cutting-stock problem." Annals of
Operations Research, 139:243-265, 2005.

For information on how to build/use the csp code see the INSTALL file.

For more information on BCP see https://projects.coin-or.org/Bcp.
