期刊
COMPUTERS & OPERATIONS RESEARCH
卷 35, 期 3, 页码 944-959出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2006.05.012
关键词
two-dimensional orthogonal packing problem; constraint programming; scheduling; energetic reasoning
The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles can be packed in a larger rectangle of fixed size. We propose an exact method for 2OPP, based on a new constraint-based scheduling model. We provide a generalization of energetic reasoning techniques for the problem under investigation. Feasibility tests requiring the solution of subset-sum problems are described. Computational results confirm the efficiency of our method compared to others in the literature. (c) 2006 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据