Recursive circle packing problems
From MaRDI portal
Publication:2803272
DOI10.1111/itor.12107zbMath1338.90351OpenAlexW2159747048MaRDI QIDQ2803272
João N. Tavares, Sílvia Cunha, João Pedro Pedroso
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
heuristicsinteger programmingcombinatorial optimizationlocal searchknapsack problemspacking problemspractice of ORloading problems
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (6)
A cutting plane method and a parallel algorithm for packing rectangles in a circular container ⋮ Quasi-human seniority-order algorithm for unequal circles packing ⋮ Heuristics for packing semifluids ⋮ Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition ⋮ Optimal packings for filled rings of circles. ⋮ Packing a fixed number of identical circles in a circular container with circular prohibited areas
Cites Work
- Unnamed Item
- 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
- Cutting circles and polygons from area-minimizing rectangles
- Packing different-sized circles into a rectangular container
- Greedy randomized adaptive search procedures
- A simulated annealing approach for the circular cutting problem
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Packing unequal circles into a strip of minimal length with a jump algorithm
- Minimizing the object dimensions in circle and sphere packing problems
- New heuristics for packing unequal circles into a circular container
- An improved typology of cutting and packing problems
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- Packing equal circles into a circle with circular prohibited areas
- Packing circles within ellipses
- Greedy algorithms for packing unequal circles into a rectangular container
This page was built for publication: Recursive circle packing problems
