Packing problems

problem in combinatorial optimization

mathematical theorem about sphere packing

dense arrangement of congruent spheres in an infinite, regular arrangement

an arrangement of non-overlapping spheres within a containing space

problem of determining the maximum number of non-overlapping spheres that can be simultaneously tangent to another sphere of the same size

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

packing problem about packing thirteen 1×2×4 blocks, one 2×2×2 block, one 1×2×2 block and three 1×1×3 blocks into a 5×5×5 box

packing problem that calls for packing six 1×2×2 blocks and three 1×1×1 blocks into a 3×3×3 box

two-dimensional packing problem

mathematical problem in operations research