Cutting Stock with Binary Patterns: Arc-flow Formulation with Graph Compression
From MaRDI portal
Publication:6258954
arXiv1502.02899MaRDI QIDQ6258954
Author name not available (Why is that?)
Publication date: 10 February 2015
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.
Has companion code repository: https://github.com/fdabrandao/vpsolver
This page was built for publication: Cutting Stock with Binary Patterns: Arc-flow Formulation with Graph Compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6258954)