Skip to main content
SpringerLink
Log in

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

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • CONCORDE. http://www.math.princeton.edu/tsp/concorde.html.

  • Concurrent Versions System. http://www.cvshome.org.

  • MIPLIB 3.0. http://www.caam.rice.edu/~bixby/miplib/miplib3.html.

  • MPL. http://www.maximal-usa.com.

  • Netcraft. http://www.netcraft.com, July 2001.

  • Open Souce Initiative. http://opensource.org.

  • Problems at DCI. http://www.research.ibm.com/dci/problems.shtml.

  • Anbil, R., F. Barahona, L. Ladanyi, R. Rushmeier, and J. Snowdon. (1999). “Ibm Makes Advances in Airline Optimization.” OR/MS Today 26, 26–29.

    Google Scholar 

  • Bahiense, L., F. Barahona, and O. Porto. (2000). “Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation.” IBM Research Report RC21847.

  • Balas, E., S. Ceria, and G. Cornuéjols. (1993). “A Lift-and-Project Cutting Plane Algorithm for Mixed 0-1 Programs.” Math. Programming 58(3, Ser. A), 295–324.

    Article  Google Scholar 

  • Balas, E., S. Ceria, and G. Cornuéjols. (1993). “Solving Mixed 0-1 Programs by a Lift-and-Project Method.” In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Austin, TX, 1993), New York, ACM, pp. 232–242.

  • Barahona, F. and R. Anbil. (1999). “Solving Large Scale Uncapacitated Facility Location Problems.” IBM Research Report RC21515.

  • Barahona, F. and R. Anbil. (2000). “The Volume Algorithm: Producing Primal Solution with a Subgradient Algorithm.” Math. Program 87, 385–399.

    Article  Google Scholar 

  • Barahona, F. and R. Anbil. (2002). “On Some Difficult Linear Programs Coming from Set Partitioning.” Discrete Appl. Math 118(1–2), 3–11; Third ALIO-EURO Meeting on Applied Combinatorial Optimization (Erice, 1999).

  • Barahona, F. and F. Chudak. (1999). “Near-Optimal Solutions to Large Scale Facility Location Problems.” IBM Research Report RC21606.

  • Barahona, F. and L. Ladanyi. (2001). “Branch and Cut Based on the Volume Algorithm: Steiner Trees in Graphs and Max-Cut.” IBM Research Report RC2222.

  • Bixby, R.E., M. Fenelon, Z. Gu, E. Rothberg, and R. Wunderling. (2000). “MIP: Theory and Practice—Closing the Gap.” In System modelling and optimization (Cambridge, 1999), Kluwer Acad. Publ., Boston, MA, pp. 19–49.

    Google Scholar 

  • Degraeve, Z. and M. Peeters. (2003). “Optimal Integer Solutions to Industrial Cutting-Stock Problems. II. Benchmark Results.” INFORMS J. Comput 15(1), 58–81.

    Article  Google Scholar 

  • Degraeve and L. Schrage. (1999). “Optimal Integer Solutions to Industrial Cutting Stock Problems.” INFORMS J. Comput. 11(14), 406–419.

    Google Scholar 

  • Eso, M., S. Gosh, L. Ladanyi, and J. Kalagnanam. (2001). “Bid Evaluation in Procurement Auctions with Piece-Wise Linear Supply Curves.” IBM Research Report RC22219.

  • Eso, M., D.L. Jensen, and L. Ladanyi. (2002). “Solving Lexicographic Multiobjective MIP with Column Generation.” INFORMS Annual Meeting, San Jose; abstract, pp. 88.

  • Farley, A. (1990). “A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems.” Operations Research 38, 922–923.

    Google Scholar 

  • Forrest, J. and J. Tomlin. (1987). “Implementing Interior Point Linear Programming Methods in the Optimization Subroutine Library.” IBM System Journal 31(1), 183–209.

    Google Scholar 

  • Fortz, B., A.R. Mahjoub, S.T. McCormick, and P. Pesneau. (2002). “The 2-edge Connected Subgraph Problem With Bounded Rings.” Preprint.

  • Galati, M. (2002). “Galexis Distribution Problem.” École Polytechnique Fédérale de Lausanne RO2002.0508.

  • Gau, T. and G. Wäscher. (1995). “Cutgen1: A Problem Generator for the Standard One-Dimensional Cutting Stock Problem.” Eur. Jour. of Oper. Res. 84, 572–579.

    Article  Google Scholar 

  • Geoffrion, A. The shared destiny initiative, see http://www.anderson.ucla.edu/informs/sdi.htm.

  • Gilmore, P.C. and R.E. Gomory. (1961). “A Linear Programming Approach to the Cutting-Stock Problem. Oper. Res. 9, 849–859.

    Google Scholar 

  • Guignard, M. and K. Spielberg. (1981). “Logical Reduction Method in Zero-One Programming (Minimal Preferred Variables).” Oper. Res. 29(1), 49–74.

    Google Scholar 

  • Günlük O. and Y. Pochet. (2001). “Mixing Mixed-Integer Inequalities. Math. Programming 90, 429–457.

    Article  Google Scholar 

  • Kalagnanam, J., M. Dawande, M. Trumbo, and H.S. Lee. (2000). “The Surplus Inventory Matching Problem in the Process Industry.” Operations Research 48(4), 505–516.

    Article  Google Scholar 

  • Ladanyi, L., J. Forrest, and J. Kalagnanam. (2001). “Column Generation Approach to the Multiple Knapsack Problem with Color Constraints.” IBM Research Report RC22013.

  • Lee, J. (2002). “Service-parts Logistics.” Tutorial on Supply Chain and Logistics Optimization, Institute for Mathematics and its Applications, University of Minnesota.

  • Lee, J. (2000). Cropped Cubes. IBM Research Report RC21830 In: Journal of Combinatorial Optimization (To appear).

  • Lemke, C.E. and K. Spielberg. (1967). “Direct Search Algorithms for Zero-One and Mixed-Integer Programming.” Oper. Res 15, 892–914.

    Article  Google Scholar 

  • Lougee-Heimer, R. (2001). “The Coin-or Initiative: Open Source Software for Optimization.” In Proceedings Third International Workshop on Integration of AI and Or Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 307–319.

  • Lougee-Heimer, R. (2002). “The Common Optimization Interface for Operations Research: Promoting Open-Source Software in the Operations Research Community.” IBM Journal of Research and Development 47(1).

  • Lougee-Heimer, R., J.P. Fasano, F. Barahona, B. Dietrich, J. Forrest, R. Harder, L. Ladanyi, T. Pfender, T. Ralphs, M. Saltzman, and K. Scheinberg. (2001). “The Coin-or Initiative: Open Source Accelerates Operations Research Progress.” ORMS Today 28(4), 20–22.

    Google Scholar 

  • Lulli, G. and S. Sen. (2001). “A Branch-and-Price Algorithm for Multi-Stage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problem.” submitted for publication.

  • Marchand, H. and L.A. Wolsey. (2001). “Aggregation and Mixed Integer Rounding to Solve MIPs.” Oper. Res. 49(3), 363–371.

    Article  Google Scholar 

  • Martello, S. and P. Toth. (1990). Knapsack problems. Wiley-Interscience Series in Discrete Mathematics and Optimization.” John Wiley & Sons Ltd., Chichester, Algorithms and computer implementations.

  • Mitchell, J.E. (1998). “An Interior Point Cutting Plane Algorithm for Ising Spin Glass Problems.” In Operations Research Proceedings 1997 (Jena), Springer: Berlin, pp. 114–119.

  • Murray, W., P. Gill, M. Saunders, and J. Tomlin. (1986). “On Projected Newton Barrier Methods for Linear Programming and an Equivalence to Karmarkar's Projective Method.” Mathematical Programming 36, 183–209.

    Google Scholar 

  • Nediak, M. and J. Eckstein. (2001). “Pivot, Cut, and Dive: A Heuristic for 0-1 Mixed Integer Programming.” RUTCOR Research Report RRR 53-2001.

  • Nemhauser, G. and L. Wolsey. (1999). Integer and Combinatorial Optimization. John Wiley & Sons Inc., New York; Reprint of the 1988 original, A Wiley-Interscience Publication.

  • Pesneau, P., A.R. Mahjoub, and S.T. McCormick. (2002). “The 2-Edge Connected Subgraph Problem With Bounded Rings.” IFORS.

  • Saltzman, M.J. (2002). “Coin-or: An Open-Source Library for Optimization.” In S. Nielsen, (ed.), Software for Compuational Economics and Finance Optimization. Kluwer.

  • Scheithauer, G. and J. Terno. (1995). “A Branch-and-Bound Algorithm for Solving One-Dimensional Cutting Stock Problems Exactly.” Appl. Math. (Warsaw) 23(2), 151–167.

    Google Scholar 

  • Valério de Carvalho J.M. (1999). “Exact Solution of Bin-Packing Problems Using Column Generation and Branch-and-Bound.” Ann. Oper. Res. 86, 629–659; Advances in combinatorial optimization (London, 1996)

  • Valério de Carvalho J.M. (2002). “A Note on Branch and Price Algorithms for the one Dimensional Cutting Stock Problem.” Comput. Optim. Appl. 21(3), 339–340.

    Article  Google Scholar 

  • Vance, P.H. (1998). “Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem.” Comput. Optim. Appl. 9(3), 211–228.

    Article  Google Scholar 

  • Vanderbeck, F. (1999). “Computational Study of a Column Generation Algorithm for Bin Packing and Cutting Stock Problems.” Math. Program. 86(3, Ser. A), 565–594.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY, 10598, USA

    Laszlo Ladanyi, Jon Lee & Robin Lougee-Heimer

Authors
  1. Laszlo Ladanyi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jon Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Robin Lougee-Heimer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Laszlo Ladanyi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ladanyi, L., Lee, J. & Lougee-Heimer, R. Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem. Ann Oper Res 139, 243–265 (2005). https://doi.org/10.1007/s10479-005-3450-1

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-005-3450-1

Keywords

Search

Navigation