Cutting Stock with Binary Patterns: Arc-flow Formulation with Graph Compression
Optimization and Control
2015-02-11 v1 Data Structures and Algorithms
Abstract
The cutting stock problem with binary patterns (0-1 CSP) is a variant of CSP that usually appears as a relaxation of 2D and 3D packing problems. We present an exact method, based on an arc-flow formulation with side constraints, for solving 0-1 CSP by simply representing all the patterns in a very compact graph. Gilmore-Gomory's column generation approach is usually used to compute strong lower bounds for 0-1 CSP. We report a computational comparison between the arc-flow approach and the Gilmore-Gomory's approach.
Cite
@article{arxiv.1502.02899,
title = {Cutting Stock with Binary Patterns: Arc-flow Formulation with Graph Compression},
author = {Filipe Brandão and João Pedro Pedroso},
journal= {arXiv preprint arXiv:1502.02899},
year = {2015}
}
Comments
arXiv admin note: text overlap with arXiv:1310.6887