Convex Maximization Formulation of General Sphere Packing Problem
We consider a general sphere packing problem which is to pack nonoverlapping spheres (balls) with the maximum volume into a convex set. This problem has important applications in science and technology. We prove that this problem is equivalent to the convex maximization problem which belongs to a cl...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Irkutsk State University
2020-03-01
|
| Series: | Известия Иркутского государственного университета: Серия "Математика" |
| Subjects: | |
| Online Access: | http://mathizv.isu.ru/en/article/file?id=1336 |