A heuristic for the circle packing problem with a variety of containers
From MaRDI portal
Publication:635155
DOI10.1016/j.ejor.2011.04.024zbMath1226.90088OpenAlexW2049150048WikidataQ56766832 ScholiaQ56766832MaRDI QIDQ635155
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Circle packings and discrete conformal geometry (52C26)
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, A formulation space search heuristic for packing unequal circles in a fixed size circular container, Differential evolution methods based on local searches, Packing unequal rectangles and squares in a fixed size circular container using formulation space search, High density packings of equal circles in rectangles with variable aspect ratio, A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints, Packing ovals in optimized regular polygons, Review of obnoxious facilities location problems, Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches, Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming, The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices, The repeated p-dispersion problem, Iterated dynamic neighborhood search for packing equal circles on a sphere, Integer programming formulations for approximate packing circles in a rectangular container, A note on solving MINLP's using formulation space search, Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting, Packing circular-like objects in a rectangular container, Packing equal circles into a circle with circular prohibited areas, Solving the maximum min-sum dispersion by alternating formulations of two different problems, Quasi-human seniority-order algorithm for unequal circles packing, Adaptive large neighborhood search for solving the circle bin packing problem, Clustering methods for large scale geometrical global optimization, On tackling reverse convex constraints for non-overlapping of unequal circles, Phase field approach to optimal packing problems and related Cheeger clusters, Repulsion-based p-dispersion with distance constraints in non-convex polygons, Iterated dynamic thresholding search for packing equal circles into a circular container, Packing a fixed number of identical circles in a circular container with circular prohibited areas
Uses Software
Cites Work
- A literature review on circle and sphere packing problems: models and methodologies
- New approaches to circle packing in a square. With program codes.
- A population-based approach for hard global optimization problems based on dissimilarity measures
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Variable space search for graph coloring
- Solving the problem of packing equal and unequal circles in a circular container
- 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
- Nonlinear optimization with GAMS /LGO
- 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
- 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
- Handbook of metaheuristics
- Global optimization on funneling landscapes
