Symmetry-breaking constraints for packing identical rectangles within polyhedra
From MaRDI portal
Publication:1940443
DOI10.1007/s11590-011-0425-9zbMath1267.90117OpenAlexW2150001295MaRDI QIDQ1940443
Publication date: 7 March 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0425-9
Related Items (3)
Wildfire burn scar encapsulation. Subsetting common spatial domains for post-wildfire debris flow predictions over the United States ⋮ Packing unequal rectangles and squares in a fixed size circular container using formulation space search ⋮ The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers
Cites Work
- Unnamed Item
- A heuristic approach for packing identical rectangles in convex regions
- Complexity and approximation of an area packing problem
- Cutting circles and polygons from area-minimizing rectangles
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- A note on an L-approach for solving the manufacturer's pallet loading problem
- Method of sentinels for packing items within arbitrary convex regions
- Encyclopedia of Optimization
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
- Using sentinels to detect intersections of convex and nonconvex polygons
This page was built for publication: Symmetry-breaking constraints for packing identical rectangles within polyhedra
