Random close pack crystal lattices have maximum densities equal to this upper limit. Random close packing does not have a precise geometric definition. It is defined statistically, and results are empirical. A container is randomly filled with objects, and then the container is shaken or tapped until the objects do not compact any further, at this point the packing state is RCP. The definition of packing fraction can be given as: "the volume taken by number of particles in a given space of volume". In other words, packing fraction defines the packing density. It has been shown that the filling fraction increases with
Bin packing problem that there always exists at least one ordering of items that allows first-fit to produce an optimal solution. A variant of bin packing that occurs in practice is when items can share space when packed into a bin. Specifically, a set of items could occupy less space when packed together than the sum of their individual sizes. This variant is known as VM packing since when virtual machines (VMs) are packed in a server, their total memory requirement could decrease due to pages shared by the VMs that need only be stored once. If items can share space in arbitrary