Mathematical optimization for packing problems
classification
🧮 math.OC
math.COmath.MG
keywords
packingoptimizationproblemsproblemresultsanalysisblendconcentrating
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.