A heuristic for the circle packing problem with a variety of containers
From MaRDI portal
Publication:635155
DOI10.1016/J.EJOR.2011.04.024zbMATH Open1226.90088DBLPjournals/eor/LopezB11OpenAlexW2049150048WikidataQ56766832 ScholiaQ56766832MaRDI QIDQ635155FDOQ635155
Authors: C. O. López, J. E. Beasley 
Publication date: 19 August 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.04.024
Recommendations
- Packing unequal circles using formulation space search
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- Packing different-sized circles into a rectangular container
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- Packing a fixed number of identical circles in a circular container with circular prohibited areas
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Circle packings and discrete conformal geometry (52C26)
Cites Work
- Handbook of metaheuristics
- New approaches to circle packing in a square. With program codes.
- Minimizing the object dimensions in circle and sphere packing problems
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- A literature review on circle and sphere packing problems: models and methodologies
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Corrigendum to ``Variable space search for graph coloring [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)]
- Reformulation descent applied to circle packing problems
- An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
- Formulation space search approach for the teacher/class timetabling problem
- Formulation Space Search for Circle Packing Problems
- A population-based approach for hard global optimization problems based on dissimilarity measures
- Variable space search for graph coloring
- Solving the problem of packing equal and unequal circles in a circular container
- Global optimization on funneling landscapes
- Nonlinear optimization with GAMS /LGO
Cited In (36)
- The repeated p-dispersion problem
- Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming
- Packing a fixed number of identical circles in a circular container with circular prohibited areas
- Integer programming formulations for approximate packing circles in a rectangular container
- Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting
- Solving the maximum min-sum dispersion by alternating formulations of two different problems
- Different formulations of the gray pattern problem and their optimal solutions
- Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium
- An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
- Proportional packing of circles in a circular container
- Iterated dynamic neighborhood search for packing equal circles on a sphere
- Clustering methods for large scale geometrical global optimization
- Variable neighborhood formulation space search for circle packing
- Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches
- A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints
- Packing equal circles into a circle with circular prohibited areas
- Adaptive large neighborhood search for solving the circle bin packing problem
- Review of obnoxious facilities location problems
- Dense packing of congruent circles in free-form non-convex containers
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- Iterated dynamic thresholding search for packing equal circles into a circular container
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- On tackling reverse convex constraints for non-overlapping of unequal circles
- Formulation Space Search for Circle Packing Problems
- Differential evolution methods based on local searches
- High density packings of equal circles in rectangles with variable aspect ratio
- Phase field approach to optimal packing problems and related Cheeger clusters
- Packing ovals in optimized regular polygons
- The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices
- Repulsion-based p-dispersion with distance constraints in non-convex polygons
- Packing circular-like objects in a rectangular container
- Reformulation descent applied to circle packing problems
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- Optimal packing configuration design with finite-circle method
- Quasi-human seniority-order algorithm for unequal circles packing
- A note on solving MINLP's using formulation space search
Uses Software
This page was built for publication: A heuristic for the circle packing problem with a variety of containers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q635155)
