## Globally Optimized Finite Packings of Arbitrary Size Spheres in R^d

This work discusses the following general packing problem-class: given a finite collection of d-dimensional spheres with arbitrarily chosen radii, find the smallest sphere in R^d that contains the entire collection of these spheres in a non-overlapping arrangement. Generally speaking, analytical solution approaches cannot be expected to apply to this general problem-type, except for very small … Read more