Mathematical optimization for packing problems
arXiv:1403.1166
Abstract
During the last few years several new results on packing problems were obtained using a blend of tools from semidefinite optimization, polynomial optimization, and harmonic analysis. We survey some of these results and the techniques involved, concentrating on geometric packing problems such as the sphere-packing problem or the problem of packing regular tetrahedra in R^3.
17 pages, written for the SIAG/OPT Views-and-News, (v2) some updates and corrections