An arc flow-based optimization approach for the two-stage guillotine strip cutting problem
针对工业中常见的两阶段切边条切割问题，提出一种基于特殊图结构的整数线性规划模型，实验表明该方法在求解高重复度实例时高效且易于实现。
Despite its broad range of industrial applications, the two-stage guillotine restriction has received very scant attention in the strip cutting literature. An integer linear programming model that is based on a special graph structure is devised for this strongly NP-hard problem. In addition to being easy to implement, the empirical study on a large set of instances from the literature and from real industrial world cases shows the efficiency of the proposed method while solving instances with high multiplicity factor.