An exact algorithm for higher-dimensional orthogonal packing
成果类型：
Article
署名作者：
Fekete, Sandor P.; Schepers, Joerg; van der Veen, Jan C.
署名单位：
Braunschweig University of Technology; International Business Machines (IBM); IBM Germany
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.1060.0369
发表日期：
2007
页码：
569-587
关键词：
摘要：
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of lower bounds, and other heuristics, we develop a two-level tree search algorithm for solving higher-dimensional packing problems to optimality. Computational results are reported, including optimal solutions for all two-dimensional test problems from recent literature. This is the third in a series of articles describing new approaches to higher-dimensional packing.