Quasi-human seniority-order algorithm for unequal circles packing

DOI10.1016/j.chaos.2016.02.030zbMath1360.52015OpenAlexW2299798418MaRDI QIDQ528450

Dingju Zhu

Publication date: 12 May 2017

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.chaos.2016.02.030

zbMATH Keywords

packing problemquasi-humanseniority-orderunequal circles

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items (1)

Adaptive large neighborhood search for solving the circle bin packing problem

Cites Work

• A formulation space search heuristic for packing unequal circles in a fixed size circular container
• Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
• A heuristic for the circle packing problem with a variety of containers
• Solving the problem of packing equal and unequal circles in a circular container
• Linear models for the approximate solution of the problem of packing equal circles into a given domain
• On-line bin packing with restricted repacking
• Packing unequal circles into a strip of minimal length with a jump algorithm
• Recursive circle packing problems
• Homoclinic and Heteroclinic Motions in Economic Models with Exogenous Shocks
• Accuracy Problems of Numerical Calculation of Fractional Order Derivatives and Integrals Applying the Riemann-Liouville/Caputo Formulas

This page was built for publication: Quasi-human seniority-order algorithm for unequal circles packing