Algorithms of optimal ball packing into ellipsoids

DOI10.20537/2226-3594-2018-52-05MaRDI QIDQ5134235zbMATH OpenOpenAlexWikidataFDO

Authors Nikita Georgievich Lavrov, P. D. 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) Combinatorial aspects of packing and covering (05B40) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

• Algorithms of optimal packing construction in ellipse
• Packing ellipsoids by nonlinear optimization
• Algorithms for congruent sphere packing and applications
• Optimal packing of general ellipses in a circle
• Optimized ellipse packings in regular polygons
• Packing ellipses in an optimized convex polygon
• Optimal arrangements in packing congruent balls in a spherical container
• scientific article; zbMATH DE number 3849991
• Packing ellipsoids in an optimized cylinder
• A heuristic algorithm for a packing problem of equal spheres in a sphere

Cites work

• scientific article; zbMATH DE number 3953655 (Why is no real title available?)
• scientific article; zbMATH DE number 3972626 (Why is no real title available?)
• scientific article; zbMATH DE number 192896 (Why is no real title available?)
• scientific article; zbMATH DE number 975560 (Why is no real title available?)
• scientific article; zbMATH DE number 3224969 (Why is no real title available?)
• scientific article; zbMATH DE number 3274206 (Why is no real title available?)
• scientific article; zbMATH DE number 3083197 (Why is no real title available?)
• Algorithms of optimal packing construction in ellipse
• Algorithms of optimal set covering on the planar R^2
• An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
• An approach to optimization in transport logistics
• Geometric properties of random disk packings.
• Packing of various radii solid spheres into a parallelepiped.
• The best possible net and the best possible cross-section of a set in a normed space

Cited in

(4)

• On the method of packing geodesic circles into a spherical segment using a plane projection
• Simulation of ellipsoidal bodies random packings by mechanical analogy
• Algorithms of optimal packing construction in ellipse
• Damped Arrow-Hurwicz algorithm for sphere packing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5134235)