An Exact Algorithm for Higher-Dimensional Orthogonal Packing

S. Fekete,Jörg Schepers,J. V. D. Veen

Published 2006 in Operational Research

ABSTRACT

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.

PUBLICATION RECORD

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-34 of 34 references · Page 1 of 1

CITED BY

Showing 1-100 of 211 citing papers · Page 1 of 3