An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems

DOI10.1007/978-3-642-02026-1_12zbMath1246.52020OpenAlexW1564189948MaRDI QIDQ3637060

Yu Zheng, Guocheng Zhou, Yonglei Yao, Huan-Tong Geng, Jing-Fa Liu

Publication date: 7 July 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02026-1_12

zbMATH Keywords

combinatorial optimizationgradient descent methodcircular packingenergy landscape pavingspherical packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Quasicrystals and aperiodic tilings in discrete geometry (52C23)

Related Items (8)

A formulation space search heuristic for packing unequal circles in a fixed size circular container ⋮ Packing unequal spheres into various containers ⋮ Packing congruent hyperspheres into a hypersphere ⋮ A heuristic for the circle packing problem with a variety of containers ⋮ Algorithms of optimal ball packing into ellipsoids ⋮ Optimized packing multidimensional hyperspheres: a unified approach ⋮ Packing equal circles into a circle with circular prohibited areas ⋮ A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure

This page was built for publication: An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems