A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems

Details A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems

2004-02-18

arxiv.org/abs/cs/0402044v1

Computer Science

Data Structures and Algorithms

16 pages, 4 figures, Latex, to appear in Mathematical Methods of Operations Research

Scientific paper

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is of crucial importance to have good and easy bounds for an optimal solution. Previous efforts have produced a number of special classes of such bounds. Unfortunately, some of these bounds are somewhat complicated and hard to generalize. We present a new approach for obtaining classes of lower bounds for higher-dimensional packing problems; our bounds improve and simplify several well-known bounds from previous literature. In addition, our approach provides an easy framework for proving correctness of new bounds.

Affiliated with

Also associated with

No associations

Rating

A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems 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 A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180814