Search Results for ""
11 - 20 of 1636 for Bin Packing ProblemSearch Results
View search results from all Wolfram sites (160700 matches)Maximize the number of cookies you can cut from a given expanse of dough (Hoffman 1998, p. 173).
The problem of determining (or counting) the set of all solutions to a given problem.
In 1803, Malfatti posed the problem of determining the three circular columns of marble of possibly different sizes which, when carved out of a right triangular prism, would ...
In hexagonal close packing, layers of spheres are packed so that spheres in alternating layers overlie one another. As in cubic close packing, each sphere is surrounded by 12 ...
There are three types of cubic lattices corresponding to three types of cubic close packing, as summarized in the following table. Now that the Kepler conjecture has been ...
In 1803, Malfatti posed the problem of determining the three circular columns of marble of possibly different sizes which, when carved out of a right triangular prism, would ...
A face-centered cubic sphere packing obtained by placing layers of spheres one on top of another. Because there are two distinct ways to place each layer on top of the ...
A honeycomb-like packing that forms hexagons.
Find the minimum size square capable of bounding n equal squares arranged in any configuration. The first few cases are illustrated above (Friedman). The only packings which ...
Bezdek and Kuperberg (1991) have constructed packings of identical ellipsoids of densities arbitrarily close to ((24sqrt(2)-6sqrt(3)-2pi)pi)/(72)=0.753355... (OEIS A093824), ...
...