A heuristic for the circle packing problem with a variety of containers
From MaRDI portal
(Redirected from Publication:635155)
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
Cites work
- A literature review on circle and sphere packing problems: models and methodologies
- A population-based approach for hard global optimization problems based on dissimilarity measures
- An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
- Corrigendum to ``Variable space search for graph coloring [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)]
- Formulation Space Search for Circle Packing Problems
- Formulation space search approach for the teacher/class timetabling problem
- Global optimization on funneling landscapes
- Handbook of metaheuristics
- 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
- New approaches to circle packing in a square. With program codes.
- Nonlinear optimization with GAMS /LGO
- Reformulation descent applied to circle packing problems
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Solving the problem of packing equal and unequal circles in a circular container
- Variable space search for graph coloring
Cited in
(43)- The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices
- On tackling reverse convex constraints for non-overlapping of unequal circles
- Packing unequal circles using formulation space search
- Packing equal circles into a circle with circular prohibited areas
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- Mixed-integer DC programming based algorithms for the circular packing problem
- Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches
- Reformulation descent applied to circle packing problems
- Adaptive large neighborhood search for solving the circle bin packing problem
- Approximate packing: integer programming models, valid inequalities and nesting
- The repeated p-dispersion problem
- Different formulations of the gray pattern problem and their optimal solutions
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search
- Phase field approach to optimal packing problems and related Cheeger clusters
- Proportional packing of circles in a circular container
- Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium
- Dense packing of congruent circles in free-form non-convex containers
- Iterated dynamic neighborhood search for packing equal circles on a sphere
- 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
- Evolutionary computation solutions to the circle packing problem
- Integer programming formulations for approximate packing circles in a rectangular container
- Iterated dynamic thresholding search for packing equal circles into a circular container
- Packing ovals in optimized regular polygons
- Repulsion-based p-dispersion with distance constraints in non-convex polygons
- Formulation Space Search for Circle Packing Problems
- Perturbation-Based Thresholding Search for Packing Equal Circles and Spheres
- Recursive circle packing problems
- A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints
- Optimal packing configuration design with finite-circle method
- A knowledge-based heuristic particle swarm optimization approach with the adjustment strategy for the weighted circle packing problem
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems
- Packing circular-like objects in a rectangular container
- Quasi-human seniority-order algorithm for unequal circles packing
- Variable neighborhood formulation space search for circle packing
- Clustering methods for large scale geometrical global optimization
- Differential evolution methods based on local searches
- A note on solving MINLP's using formulation space search
- High density packings of equal circles in rectangles with variable aspect ratio
- An action-space-based global optimization algorithm for packing circles into a square container
- Solving the maximum min-sum dispersion by alternating formulations of two different problems
- Review of obnoxious facilities location problems
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)
