Greedy algorithms for packing unequal circles into a rectangular container
From MaRDI portal
Recommendations
- Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Greedy vacancy search algorithm for packing equal circles in a square
- Greedy algorithms for packing unequal spheres into a cuboidal strip or a cuboid
- Efficient algorithms for the dense packing of congruent circles inside a square
- New heuristics for packing unequal circles into a circular container
- Packing unequal circles using formulation space search
- scientific article; zbMATH DE number 1629820
Cited in
(34)- Packing cylinders and rectangular parallelepipeds with distances between them into a given region
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- Cutting circles and polygons from area-minimizing rectangles
- Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße. (Heuristics for the solution of the two-dimensional packing problem for cylinders)
- A local search-based method for sphere packing problems
- 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
- A reference length approach for the 3D strip packing problem
- Optimized packing multidimensional hyperspheres: a unified approach
- Adaptive large neighborhood search for solving the circle bin packing problem
- Optimized filling of a given cuboid with spherical powders for additive manufacturing
- Packing non-identical circles within a rectangle with open length
- Packing unequal circles into a strip of minimal length with a jump algorithm
- Adaptive and restarting techniques-based algorithms for circular packing problems
- New heuristics for packing unequal circles into a circular container
- scientific article; zbMATH DE number 1629820 (Why is no real title available?)
- Recursive circle packing problems
- Adaptive beam search lookahead algorithms for the circular packing problem
- Packing identical spheres into a cylinder
- Greedy algorithms for packing unequal spheres into a cuboidal strip or a cuboid
- A knowledge-based heuristic particle swarm optimization approach with the adjustment strategy for the weighted circle 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
- Packing unequal spheres into various containers
- Differential evolution methods based on local searches
- An action-space-based global optimization algorithm for packing circles into a square container
- An anchorage planning strategy with safety and utilization considerations
- A model to design recreational boat mooring fields
- A literature review on circle and sphere packing problems: models and methodologies
- Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
- A filtered beam search based heuristic algorithm for packing unit circles into a circular container
- Efficiently packing unequal disks in a circle
- Solving circle packing problems by global optimization: numerical results and industrial applications
- A beam search algorithm for the circular packing problem
This page was built for publication: Greedy algorithms for packing unequal circles into a rectangular container
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464427)
