Mathematical optimization for packing problems
Optimization and Control
2016-02-10 v2 Combinatorics
Metric Geometry
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.
Cite
@article{arxiv.1403.1166,
title = {Mathematical optimization for packing problems},
author = {Fernando Mário de Oliveira Filho and Frank Vallentin},
journal= {arXiv preprint arXiv:1403.1166},
year = {2016}
}
Comments
17 pages, written for the SIAG/OPT Views-and-News, (v2) some updates and corrections