| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652292 | Electronic Notes in Discrete Mathematics | 2012 | 8 Pages |
Abstract
This paper applies a variable neighborhood search (VNS) to the difficult problem of packing unit radii spheres into the smallest cube (PSC). VNS identifies (near-) global optima by searching the neighborhoods of local minima. It obtains neighboring solutions by shaking one or more spheres. It alters the size of a neighborhood every time it fails to find an improving solution. VNS matches 42 out of 55 upper bounds.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
