A heuristic approach for packing identical rectangles in convex regions
From MaRDI portal
Publication:632680
DOI10.1016/j.cor.2010.12.001zbMath1208.90141OpenAlexW2074387730MaRDI QIDQ632680
Andrea Cassioli, Marco Locatelli
Publication date: 25 March 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.12.001
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (7)
Packing unequal rectangles and squares in a fixed size circular container using formulation space search ⋮ Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches ⋮ A cutting plane method and a parallel algorithm for packing rectangles in a circular container ⋮ Symmetry-breaking constraints for packing identical rectangles within polyhedra ⋮ Numerical optimization method for packing regular convex polygons ⋮ Orientational variable-length strip covering problem: a branch-and-price-based algorithm ⋮ Packing Problems in Space Solved by CPLEX: An Experimental Analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving irregular strip packing problems by hybridising simulated annealing and linear program\-ming
- New approaches to circle packing in a square. With program codes.
- On the limited memory BFGS method for large scale optimization
- Efficiently packing unequal disks in a circle
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Solving the problem of packing equal and unequal circles in a circular container
- Cutting circles and polygons from area-minimizing rectangles
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
- Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond
- Packing up to 50 equal circles in a square
- Improving dense packings of equal disks in a square
- Packing equal circles in a square: A deterministic global optimization approach
- More optimal packings of equal circles in a square
- An improved algorithm for the packing of unequal circles within a larger containing circle
- 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
- The geometry of nesting problems: a tutorial
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- Minimizing the object dimensions in circle and sphere packing problems
- Adaptive and restarting techniques-based algorithms for circular packing problems
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- An improved typology of cutting and packing problems
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- Disk Packing in a Square: A New Global Optimization Approach
- Method of sentinels for packing items within arbitrary convex regions
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- Global Optimization in Geometry — Circle Packing into the Square
- Global optimization on funneling landscapes
This page was built for publication: A heuristic approach for packing identical rectangles in convex regions
