Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem

Laszlo Ladanyi (), Jon Lee () and Robin Lougee-Heimer ()

Annals of Operations Research, 2005, vol. 139, issue 1, 243-265

Abstract: 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 finding integer-optimal solutions to a cutting-stock problem. Copyright Springer Science + Business Media, Inc. 2005

Keywords: open-source software; cutting stock problem; branch-and-price methods; integer programming (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-005-3450-1 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:139:y:2005:i:1:p:243-265:10.1007/s10479-005-3450-1

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-005-3450-1

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().