论文标题
精确的解决方案技术，用于二维切割和包装
Exact Solution Techniques for Two-dimensional Cutting and Packing
论文作者
论文摘要
我们调查了二维正交切割和包装问题的主要配方和解决方案方法，其中项目和垃圾箱都是矩形。我们关注文献中四个主要问题的精确方法和放松：找到具有最低高度的包装，将项目包装到最小数量的垃圾箱中，找到最大值的包装，并确定存在可行的包装。
We survey the main formulations and solution methods for two-dimensional orthogonal cutting and packing problems, where both items and bins are rectangles. We focus on exact methods and relaxations for the four main problems from the literature: finding a packing with minimum height, packing the items into the minimum number of bins, finding a packing of maximum value, and determining the existence of a feasible packing.
