Skip to main content
SpringerLink
Log in

A branch-and-price algorithm for solving the cutting strips problem

  • Published:
Applied Mathematics-A Journal of Chinese Universities Aims and scope Submit manuscript

Abstract

After giving a suitable model for the cutting strips problem, we present a branch-and-price algorithm for it by combining the column generation technique and the branch-and-bound method with LP relaxations. Some theoretical issues and implementation details about the algorithm are discussed, including the solution of the pricing subproblem, the quality of LP relaxations, the branching scheme as well as the column management. Finally, preliminary computational experience is reported.

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

  1. Barnhart, C., etc., Branch-and-price: column generation for solving huge integer programs, Report COC-94-03, School of Industrial and Systems Engineering, Georgia Institute of Technology Atlanta, Georgia, 1994.

    Google Scholar 

  2. Forrest, J. J. H., etc., Practical solution of large mixed integer programming problems with UMPIRE, Management Science, 20(1974), 736–773.

    MATH  MathSciNet  Google Scholar 

  3. Geoffrion, A. M., Lagrangian relaxation for integer programming, Math. Programming Study, 2 (1974),82–114.

    MathSciNet  Google Scholar 

  4. Gilmore, P. C. and Gomory,R. E., A linear programming approach to the cutting-stock problem, Oper. Res., 9(1961),849–859.

    MATH  MathSciNet  Google Scholar 

  5. Gilmore, P. C. and Gomory,R. E., Multistage cutting stock problems of two and more dimensions, Oper. Res., 13(1964), 94–120.

    Article  MathSciNet  Google Scholar 

  6. Martello, S. and Toth, P., Knapsack Problems: Algorithms and Computer Implementations, John Wiley & Sons, Inc., New York, 1990.

    MATH  Google Scholar 

  7. Nemhauser, G. L., Wolsey, L. A., Integer and Combinatorial Optimization, John Wiley & Sons, Inc., New York, 1988.

    MATH  Google Scholar 

  8. Savelsbergh, M. W. P. and Nemhauser, G. L., Functional Description of MINTO, a Mixed Integer Optimizer, Version 1. 6, Technical Report, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA.USA, 1993.

    Google Scholar 

  9. Sol, Marc., Column Generation Techniques for Pickup and Delivery Problems, Ph. D. dissertation, Department of Mathematics and Computing Sciences, Eindhoven University of Technology, Eindhoven, The Netherlands, 1994.

    Google Scholar 

  10. Vance, P. H., et al., Solving binary cutting stock problems by column generation and branch-and-bound, Computational Optimization and Applications, 3(1994), 111–130.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departmeat of Mathematics, Xi′an Jiaotong University, 710049, Xi′an

    Chen Zhiping

  2. Depantmeat of Mathematics and Computing Sciences, Eindhoven University of Technology, The Nertherlands

    C. A. J. Hurkens

  3. Department of Mathematics and Computing Sciences, Eindhoven University of Technology, The Nertherlands

    J. L. de Jong

Authors
  1. Chen Zhiping
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. A. J. Hurkens
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. L. de Jong
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhiping, C., Hurkens, C.A.J. & de Jong, J.L. A branch-and-price algorithm for solving the cutting strips problem. Appl. Math. Chin. Univ. 12, 215–224 (1997). https://doi.org/10.1007/s11766-997-0022-y

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11766-997-0022-y

Keywords

Search

Navigation