Recursive circle packing problems

DOI10.1111/ITOR.12107zbMATH Open1338.90351OpenAlexW2159747048MaRDI QIDQ2803272FDOQ2803272

Authors João Pedro Pedroso, Sílvia Cunha, João Nuno Tavares 

Publication date 4 May 2016

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/itor.12107

zbMATH Keywords

heuristicscombinatorial optimizationlocal searchinteger programmingknapsack problemspacking problemspractice of ORloading problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• Packing different-sized circles into a rectangular container
• Greedy algorithms for packing unequal circles into a rectangular container
• Proportional packing of circles in a circular container
• A heuristic for the circle packing problem with a variety of containers
• A dynamic adaptive local search algorithm for the circular packing problem

Cites work

• scientific article; zbMATH DE number 2058369 (Why is no real title available?)
• A literature review on circle and sphere packing problems: models and methodologies
• A mathematical model and a solution method for the problem of placing various-sized circles into a strip
• A simulated annealing approach for the circular cutting problem
• An improved typology of cutting and packing problems
• Cutting circles and polygons from area-minimizing rectangles
• Greedy algorithms for packing unequal circles into a rectangular container
• Greedy randomized adaptive search procedures
• 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 heuristics for packing unequal circles into a circular container
• Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
• Packing circles within ellipses
• Packing different-sized circles into a rectangular container
• Packing equal circles into a circle with circular prohibited areas
• Packing unequal circles into a strip of minimal length with a jump algorithm
• 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

Cited in

(9)

• Optimal packings for filled rings of circles.
• Packing a fixed number of identical circles in a circular container with circular prohibited areas
• Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition
• scientific article; zbMATH DE number 2058369 (Why is no real title available?)
• A cutting plane method and a parallel algorithm for packing rectangles in a circular container
• Quasi-human seniority-order algorithm for unequal circles packing
• Recursive sequences in the Ford sphere packing
• Heuristics for packing semifluids
• PERM for solving circle packing problem

This page was built for publication: Recursive circle packing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803272)