Implementation of an exact algorithm for a cutting-stock problem using components of COIN-OR

The rate at which research ideas can be prototyped is significantly increased when re-useable software components are employed. A mission of the Computational Infrastructure for Operations Research (COIN-OR) initiative is to promote the development and use of re-useable open-source tools for operations research professionals. In this paper, we introduce the COIN-OR initiative and survey recent progress in integer programming that utilizes COIN-OR components. In particular, we present an implementation of an algorithm for find-ing integer-optimal solutions to a cutting-stock problem.

By: Laszlo Ladanyi, Jonathan Lee, Robin Lougee-Heimer

Published in: Annals of Operations Research, volume 139, (no 1), pages 243-65 in 2005

Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.

Questions about this service can be mailed to .