Quasi-human seniority-order algorithm for unequal circles packing
From MaRDI portal
Publication:528450
Recommendations
- An improved algorithm for the packing of unequal circles within a larger containing circle
- scientific article; zbMATH DE number 6178326
- An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
- Packing unequal circles using formulation space search
- scientific article; zbMATH DE number 5629935
Cites work
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- A heuristic for the circle packing problem with a variety of containers
- Accuracy Problems of Numerical Calculation of Fractional Order Derivatives and Integrals Applying the Riemann-Liouville/Caputo Formulas
- Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
- Homoclinic and heteroclinic motions in economic models with exogenous shocks
- 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
- Solving the problem of packing equal and unequal circles in a circular container
Cited in
(2)
This page was built for publication: Quasi-human seniority-order algorithm for unequal circles packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528450)
