Solving the problem of packing equal and unequal circles in a circular container
From MaRDI portal
Publication:969742
DOI10.1007/s10898-009-9458-3zbMath1190.90161OpenAlexW1965660671MaRDI QIDQ969742
A. R. M. J. U. Jamali, Marco Locatelli, Andrea Grosso, Fabio Schoen
Publication date: 7 May 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9458-3
Related Items
Dense packing of congruent circles in free-form non-convex containers, Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium, Adaptive simulated annealing with greedy search for the circle bin packing problem, Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container, A formulation space search heuristic for packing unequal circles in a fixed size circular container, Differential evolution methods based on local searches, An action-space-based global optimization algorithm for packing circles into a square container, An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container, A memetic algorithm to pack unequal circles into a square, Approximation schemes for covering and packing problems in image processing and VLSI, Iterated dynamic neighborhood search for packing equal circles on a sphere, Packing congruent hyperspheres into a hypersphere, A heuristic approach for packing identical rectangles in convex regions, A heuristic for the circle packing problem with a variety of containers, Packing equal circles into a circle with circular prohibited areas, Quasi-human seniority-order algorithm for unequal circles packing, On limits of dense packing of equal spheres in a cube, Global optimization method for finding dense packings of equal circles in a circle, Maximizing the sum of radii of balls inscribed in a polyhedral set, Phase field approach to optimal packing problems and related Cheeger clusters, Iterated dynamic thresholding search for packing equal circles into a circular container, Non-removable term ergodic action semigroups/groups, Continuous cubic formulations for cluster detection problems in networks, Global Optimization Approaches for Optimal Trajectory Planning, Linear models for the approximate solution of the problem of packing equal circles into a given domain
Uses Software
Cites Work
- New approaches to circle packing in a square. With program codes.
- A population-based approach for hard global optimization problems based on dissimilarity measures
- Efficiently packing unequal disks in a circle
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Cutting circles and polygons from area-minimizing rectangles
- Packing up to 50 equal circles in a square
- Improving dense packings of equal disks in a square
- Packing equal circles in a square: A deterministic global optimization approach
- Reformulation descent applied to circle packing problems
- More optimal packings of equal circles in a square
- An improved algorithm for the packing of unequal circles within a larger containing circle
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- Minimizing the object dimensions in circle and sphere packing problems
- Adaptive and restarting techniques-based algorithms for circular packing problems
- Disk Packing in a Square: A New Global Optimization Approach
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Global Optimization in Geometry — Circle Packing into the Square
- Global optimization on funneling landscapes
- Unnamed Item
- Unnamed Item
- Unnamed Item
