Skip to main content
SpringerLink
Log in

A Note on Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problems

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

One algorithm proposed in “Branch-and-price algorithms for the one-dimensional cutting stock problems” (COAP, vol. 9, pp. 211–228, 1998) may not find an optimal solution to the cutting stock problem, as it is stated.

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

Reference

  1. P. Vance, “Branch-and-price algorithms for the one-dimensional cutting stock problem,” Computational Optimization and Applications, vol. 9, pp. 211–228, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Produção e Sistemas, Universidade do Minho, 4710-057, Braga, Portugal

    J.M. Valério de Carvalho

Authors
  1. J.M. Valério de Carvalho
    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

de Carvalho, J.V. A Note on Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problems. Computational Optimization and Applications 21, 339–340 (2002). https://doi.org/10.1023/A:1013733421344

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1013733421344

Search

Navigation