This paper proposes an algorithm to compute a lower bound for the cutting stock problem subject to a limited number s of open stacks. The algorithm employs an enumeration scheme based on algebraic properties of the problem. Search is shortened by bounds computed via column generation and by symmetry breaking, implemented to avoid the repeated evaluation of equivalent solutions. A preliminary computational experience confirms the effectiveness of the method.

A Lower Bound for the Cutting Stock Problem with a Limited Number of Open Stacks

ARBIB, CLAUDIO;SCOPPOLA, CARLO MARIA
2009-01-01

Abstract

This paper proposes an algorithm to compute a lower bound for the cutting stock problem subject to a limited number s of open stacks. The algorithm employs an enumeration scheme based on algebraic properties of the problem. Search is shortened by bounds computed via column generation and by symmetry breaking, implemented to avoid the repeated evaluation of equivalent solutions. A preliminary computational experience confirms the effectiveness of the method.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11697/35395
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? ND
social impact