Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to...

The bin packing problem is an optimization problem, in which items of different sizes must be packed into a finite number of bins or containers, each of...

sphere packing problems can be generalised to consider unequal spheres, spaces of other dimensions (where the problem becomes circle packing in two dimensions...

Square packing is a packing problem where the objective is to determine how many congruent squares can be packed into some larger shape, often a square...

Circle packing in a square is a packing problem in recreational mathematics, where the aim is to pack n unit circles into the smallest possible square...

knapsack problem Cutting stock problem – Mathematical problem in operations research Knapsack auction List of knapsack problems Packing problem – Problems which...

Set packing is a classical NP-complete problem in computational complexity theory and combinatorics, and was one of Karp's 21 NP-complete problems. Suppose...

Rectangle packing is a packing problem where the objective is to determine whether a given set of small rectangles can be placed inside a given large polygon...

Sphere packing in a sphere is a three-dimensional packing problem with the objective of packing a given number of equal spheres inside a unit sphere. It...

space to the volume of the space itself. In packing problems, the objective is usually to obtain a packing of the greatest possible density. If K1,......