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

  • Authors:

  • J.M. Valério De Carvalho

  • Affiliations:

  • Dept. Produção e Sistemas, Universidade do Minho, 4710-057 Braga, Portugal. vc@dps.uminho.pt

  • Venue:
  • Computational Optimization and Applications
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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.