期刊
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH
卷 18, 期 3, 页码 293-339出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s10288-019-00419-9
关键词
Grid of points; Reduction procedures; Canonical dissections; Reduced raster points; Meet-in-the-middle patterns; Two-dimensional knapsack problem
Different grids of points to solve cutting and packing problems with rectangular shaped items are discussed in this work. The grids are the canonical dissections (also known as normal patterns), useful numbers, reduced raster points, regular normal patterns, and meet-in-the-middle patterns. Theoretical results involving the size and subset relations among the grids are proposed, besides practical procedures to reduce the size. Computational experiments are performed in which the two-dimensional (2D) knapsack problem is solved with an integer linear programming model. The results show the impact on the grids before and after applying the reduction procedures, concluding that the reduced raster points and meet-in-the-middle patterns are generally the grids with the smallest number of points.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据