Algorithms of optimal ball packing into ellipsoids

DOI10.20537/2226-3594-2018-52-05zbMath1446.05014OpenAlexW2907761002WikidataQ128646966 ScholiaQ128646966MaRDI QIDQ5134235

Nikita Georgievich Lavrov, Pavel Dmitrievich Lebedev

Publication date: 16 November 2020

Published in: Izvestiya Instituta Matematiki i Informatiki. Udmurt. Gos. Univ. (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/iimi361

zbMATH Keywords

iterative algorithmpackingChebyshev centerface-centered cubic latticesuper differential

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approach to optimization in transport logistics
• Packing of various radii solid spheres into a parallelepiped.
• Geometric properties of random disk packings.
• An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
• Algorithms of Optimal Packing Construction in Ellipse
• Algorithms of optimal set covering on the planar R^2
• The best possible net and the best possible cross-section of a set in a normed space

This page was built for publication: Algorithms of optimal ball packing into ellipsoids