Packing unequal spheres into various containers

DOI10.1007/S10559-016-9842-1MaRDI QIDQ334249zbMATH OpenOpenAlexFDO

Authors Guntram Scheithauer, G. N. Yas'kov, Yu. Stoyan

Publication date 1 November 2016

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-016-9842-1

zbMATH Keywords

jump algorithmnon-convex optimization problempackingsphere packing

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial optimization (90C27)

Recommendations

• On packing spheres into containers
• scientific article; zbMATH DE number 3068599
• Sphere packing
• Packing a large number of congruent spheres into a cylinder
• Packing identical spheres into a cylinder
• Packing different-sized circles into a rectangular container
• Packing different cuboids with rotations and spheres into a cuboid
• Placing and moving spheres in the gaps of a cylinder packing
• Solving the problem of packing equal and unequal circles in a circular container

Cites work

• A literature review on circle and sphere packing problems: models and methodologies
• A mathematical model and a solution method for the problem of placing various-sized circles into a strip
• An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
• Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
• Greedy algorithms for packing unequal circles into a rectangular container
• Greedy algorithms for packing unequal spheres into a cuboidal strip or a cuboid
• Minimizing the object dimensions in circle and sphere packing problems
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• On the polynomial approximation of a conformal mapping of a domain with nonzero corner
• Packing identical spheres into a cylinder
• Packing of various radii solid spheres into a parallelepiped.
• Packing unequal circles into a strip of minimal length with a jump algorithm
• Sphere packings, lattices and groups. With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov.

Cited in

(13)

• Packing of various radii solid spheres into a parallelepiped.
• A local search-based method for sphere packing problems
• Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study
• Optimized packing multidimensional hyperspheres: a unified approach
• Optimized filling of a given cuboid with spherical powders for additive manufacturing
• Non-uniform packings
• Iterated dynamic thresholding search for packing equal circles into a circular container
• -functions of 2D objects with boundaries being second-order curves
• A method for searching for a local minimum in the problem of packing various balls in a right cylinder.
• A heuristic algorithm for a packing problem of equal spheres in a sphere
• Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem
• Packing spheres with quasi-containment conditions
• The method of artificial space dilation in problems of optimal packing of geometric objects

Describes a project that uses

Uses Software

• Ipopt

This page was built for publication: Packing unequal spheres into various containers

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