Counterexamples in the CSP

Cutting Stock with Binary Patterns: Arc-flow Formulation with Graph Compression

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.

对双目标切割问题中嵌入标量化方法的列生成方法的研究

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem

本文研究了一维和二维切割问题的双目标问题，采用动态列生成嵌入标量化方法，发现其能更准确地逼近帕累托前沿，而标量化方法则互补性更强。