Packing congruent hyperspheres into a hypersphere

DOI10.1007/s10898-011-9716-zzbMath1244.90200OpenAlexW2138405342MaRDI QIDQ427402

Georgiy Yaskov, Yu. G. Stoyan

Publication date: 13 June 2012

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-011-9716-z

zbMATH Keywords

optimizationpackingmathematical modelhyperspherehexagonal lattice

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (14)

Quasi-phi-functions and optimal packing of ellipses ⋮ Packing ellipsoids by nonlinear optimization ⋮ A nonlinear programming model with implicit variables for packing ellipsoids ⋮ Minimizing late deliveries in a truck loading problem ⋮ Packing circles into perimeter-minimizing convex hulls ⋮ Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem ⋮ Packing unequal circles into a strip of minimal length with a jump algorithm ⋮ Optimized packing multidimensional hyperspheres: a unified approach ⋮ Packing equal circles into a circle with circular prohibited areas ⋮ Packing circles within ellipses ⋮ A support tool for planning classrooms considering social distancing between students ⋮ Packing a fixed number of identical circles in a circular container with circular prohibited areas ⋮ Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications ⋮ Constraints in container loading -- a state-of-the-art review

Uses Software

• HOPDM
• kepler98

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global dynamics of a dengue epidemic mathematical model
• A literature review on circle and sphere packing problems: models and methodologies
• Solving the problem of packing equal and unequal circles in a circular container
• Packing cylinders and rectangular parallelepipeds with distances between them into a given region
• Cutting circles and polygons from area-minimizing rectangles
• HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
• A polyhedral branch-and-cut approach to global optimization
• New results in the packing of equal circles in a square
• Minimizing the object dimensions in circle and sphere packing problems
• A proof of the Kepler conjecture
• An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems

This page was built for publication: Packing congruent hyperspheres into a hypersphere