||This article needs attention from an expert in Computer
science. (November 2008)| |Part of a series on| Packing problems
are a class of optimization problems in mathematics that involve
attempting to pack objects together into containers. The goal is
to either pack a single container as densely as possible or pack
all objects using as few containers as possible. Many of these
problems can be related to real life packaging, storage and
transportation issues. Each packing problem has a dual covering
problem, which asks how many of the same objects are required to
completely cover every region of the container, where objects
are allowed to overlap. In a packing problem, you are given: -
'containers' (usually a single two- or three-dimensional convex
region, or an infinite space) - A set of 'objects' some or all
of which must be packed into one or more containers. The set may
contain different objects with their sizes specified, or a
single object of a fixed dimension that can be used repeatedly.
Usually the pa