An exact algorithm for higher-dimensional orthogonal packing

Details An exact algorithm for higher-dimensional orthogonal packing An exact algorithm for higher-dimensional orthogonal packing

2006-04-11

arxiv.org/abs/cs/0604045v1

Computer Science

Data Structures and Algorithms

31 pages, 6 figures, 9 tables, to appear in Operations Research; full and updated journal version of sketches that appeared as

Scientific paper

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; see cs.DS/0310032 and cs.DS/0402044.

Affiliated with

Also associated with

No associations

Rating

An exact algorithm for higher-dimensional orthogonal packing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An exact algorithm for higher-dimensional orthogonal packing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An exact algorithm for higher-dimensional orthogonal packing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-286273