Convex maximization formulation of general sphere packing problem
From MaRDI portal
Publication:2307930
DOI10.26516/1997-7670.2020.31.142zbMath1441.90133OpenAlexW3012489717MaRDI QIDQ2307930
Publication date: 25 March 2020
Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)
Full work available at URL: http://mathizv.isu.ru/en/article/file?id=1336
Related Items (3)
Application of sphere packing theory in financial management ⋮ A sphere packing approach to break even and profitability analysis ⋮ Application of survival theory in mining industry
Uses Software
Cites Work
- Unnamed Item
- Global optimization approach to Malfatti's problem
- On local search in d.c. optimization problems
- Solving Malfatti's high dimensional problem by global optimization
- Global search method for solving Malfatti's four-circle problem
- Optimising the palletisation of cylinders in cases
- The discrete p-dispersion problem
- Computing a global optimal solution to a design centering problem
- Integrated container loading software for pulp and paper industry
- Approximate algorithms for constrained circular cutting problems
- DISCON: A New Method for the Layout Problem
- Solving the Continuous p-Dispersion Problem Using Non-linear Programming
This page was built for publication: Convex maximization formulation of general sphere packing problem