A heuristic algorithm for a packing problem of equal spheres in a sphere

MaRDI QIDQ2858878zbMATH OpenFDO

Authors Wenqi Huang, Liang Yu

Publication date 19 November 2013

Published in Journal of Huazhong University of Science and Technology (Search for Journal in Brave)

zbMATH Keywords

equal sphere packing problemheuristicNP-hardquasi physical methodserial symmetrical relocation strategy

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 5629935
• Dense packings of equal spheres in a cube
• Packing unequal spheres into various containers
• An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
• Greedy vacancy search algorithm for packing equal circles in a square

Cited in

(5)

• Algorithms of optimal ball packing into ellipsoids
• STUDY OF THE UNEQUAL SPHERES PACKING PROBLEM: AN APPLICATION TO RADIOSURGERY TREATMENT
• Packing spheres with quasi-containment conditions
• Damped Arrow-Hurwicz algorithm for sphere packing
• Convergence analysis of a heuristic collective sphere packing algorithm

This page was built for publication: A heuristic algorithm for a packing problem of equal spheres in a sphere

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