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...

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...

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...

displaying wikidata descriptions as a fallback List of knapsack problems Packing problem – Problems which attempt to find the most efficient way to pack objects...

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...

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,......

hexagonal packing is generally not optimal for small numbers of circles. Specific problems of this type that have been studied include: Circle packing in a...

sphere packings thanks to their large number. Sphere packing problems are distinguished between packings in given containers and free packings. This article...

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....

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...

Circle packing in a circle is a two-dimensional packing problem with the objective of packing unit circles into the smallest possible larger circle. If...

Discrete Ham-Sandwich Theorems: Provably Good Algorithms for Routing and Packing Problems". UC Berkeley. Retrieved 19 May 2014. Advisor: Clark D. Thompson Roth...

applications, such as packing objects into shipping containers (see e.g. containerization: the related sphere packing problem has been studied since...

The strip packing problem is a 2-dimensional geometric minimization problem. Given a set of axis-aligned rectangles and a strip of bounded width and infinite...

Wonderland. In his book The Game of Logic he introduced a game to solve problems such as confirming the conclusion "Some greyhounds are not fat" from the...

In geometry, close-packing of equal spheres is a dense arrangement of congruent spheres in an infinite, regular arrangement (or lattice). Carl Friedrich...

patterns by many orders of magnitude. Gosper has created numerous packing problem puzzles, such as "Twubblesome Twelve". Gosper was the first person...

and astronomer Johannes Kepler, is a mathematical theorem about sphere packing in three-dimensional Euclidean space. It states that no arrangement of...

that. Covering problems are minimization problems and usually integer linear programs, whose dual problems are called packing problems. The most prominent...

Hilbert's problems are 23 problems in mathematics published by German mathematician David Hilbert in 1900. They were all unsolved at the time, and several...

Sphere packing in a cylinder is a three-dimensional packing problem with the objective of packing a given number of identical spheres inside a cylinder...

one need be output. This problem is sometimes referred to as "vertex packing". In the maximum-weight independent set problem, the input is an undirected...

spheres it touches. For a lattice packing the kissing number is the same for every sphere, but for an arbitrary sphere packing the kissing number may vary from...

classification of problem-solving tasks is into well-defined problems with specific obstacles and goals, and ill-defined problems in which the current...

optimization problem that has an approximation algorithm. Its decision version, the vertex cover problem, was one of Karp's 21 NP-complete problems and is therefore...

a sealing material Packing problems, a family of optimization problems in mathematics All pages with titles beginning with Packing All pages with titles...

Unsolved problem in mathematics Is there any three-dimensional convex body with lower packing density than the sphere? More unsolved problems in mathematics...

Many mathematical problems have been stated but not yet solved. These problems come from many areas of mathematics, such as theoretical physics, computer...