Packing unequal circles into a strip of minimal length with a jump algorithm
From MaRDI portal
Publication:2448172
DOI10.1007/s11590-013-0646-1zbMath1292.90259OpenAlexW2159029513MaRDI QIDQ2448172
Publication date: 30 April 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-013-0646-1
Related Items
Wildfire burn scar encapsulation. Subsetting common spatial domains for post-wildfire debris flow predictions over the United States ⋮ A formulation space search heuristic for packing unequal circles in a fixed size circular container ⋮ Packing unequal spheres into various containers ⋮ A memetic algorithm to pack unequal circles into a square ⋮ A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints ⋮ Packing circles into perimeter-minimizing convex hulls ⋮ Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem ⋮ Optimized packing multidimensional hyperspheres: a unified approach ⋮ The method of artificial space dilation in problems of optimal packing of geometric objects ⋮ Quasi-human seniority-order algorithm for unequal circles packing ⋮ Optimization of 3D objects layout into a multiply connected domain with account for shortest distances ⋮ Recursive circle packing problems ⋮ Iterated dynamic thresholding search for packing equal circles into a circular container
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Packing congruent hyperspheres into a hypersphere
- Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
- New approaches to circle packing in a square. With program codes.
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Packing different-sized circles into a rectangular container
- Approximate algorithms for constrained circular cutting problems
- Packing equal circles in a square: A deterministic global optimization approach
- 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
- Packing non-identical circles within a rectangle with open length
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- An improved typology of cutting and packing problems
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Algorithms for the circular two‐dimensional open dimension problem
- Greedy algorithms for packing unequal circles into a rectangular container
