Packing non-identical circles within a rectangle with open length
From MaRDI portal
Publication:2392114
DOI10.1007/s10898-012-9948-6zbMath1272.90069MaRDI QIDQ2392114
Publication date: 1 August 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10072/52058
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
A formulation space search heuristic for packing unequal circles in a fixed size circular container, Packing unequal circles into a strip of minimal length with a jump algorithm
Cites Work
- Unnamed Item
- 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
- Three-dimensional bin packing problem with variable bin height
- Packing different-sized circles into a rectangular container
- Genetic algorithm crossover operators for ordering applications
- Approximate algorithms for constrained circular cutting problems
- A global search framework for practical three-dimensional packing with variable carton orientations
- 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
- 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
