Greedy algorithms for packing unequal circles into a rectangular container

DOI10.1057/palgrave.jors.2601836zbMath1095.90095MaRDI QIDQ5464427

Wenqi Huang, Chu-Min Li, Hakim Akeb, Yu Li

Publication date: 17 August 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601836

zbMATH Keywords

combinatorial optimization; greedy algorithm; heuristic; circle packing problem

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C27: Combinatorial optimization

Related Items

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, Solving circle packing problems by global optimization: numerical results and industrial applications, A beam search algorithm for the circular packing problem, 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, A reference length approach for the 3D strip packing problem, Packing non-identical circles within a rectangle with open length, Adaptive and restarting techniques-based algorithms for circular 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 model to design recreational boat mooring fields