A lower bound for the cutting stock problem with a limited number of open Stacks

8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009 - Proceedings of the Conference

Volumn , Issue , 2009, Pages 75-78

  Arbib, Claudio ^a   Marinelli, Fabrizio ^b   Scoppola, Carlo M ^a  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITÀ POLITECNICA DELLE MARCHE   (Italy)

Author keywords

Cutting stock problem; Lower bounds

Indexed keywords

COMBINATORIAL OPTIMIZATION; LINEAR PROGRAMMING;

ALGEBRAIC PROPERTIES; COLUMN GENERATION; CUTTING STOCK PROBLEM; ENUMERATION SCHEMES; LOWER BOUNDS; OPEN STACKS; SYMMETRY-BREAKING;

INTEGER PROGRAMMING;

EID: 79955590492     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. Arbib, C., F. Marinelli, F. Pezzella, Trim Loss Minimization Under a Given Number of Open Stacks, XXXIX Conference, AIRO 2008, Ischia, Italy, September 7-11, 2008.
2. Belov, G. and G. Scheithauer, Setups and open-stacks minimization in onedimensional stock cutting, INFORMS J. on Computing, 19 1 (2007) 27-35.
3. Wäscher G., H. Haußner, H. Schumann, An improved typology of cutting and packing problems, European Journal of Operational Research, 183 (2007) 1109-1130.