PACKING SOFT RECTANGLES
From MaRDI portal
Publication:5493900
DOI10.1142/S0129054106004327zbMath1103.68142MaRDI QIDQ5493900
Publication date: 16 October 2006
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (3)
\(\gamma\)-soft packings of rectangles ⋮ An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules ⋮ Exact and approximation algorithms for a soft rectangle packing problem
Cites Work
- Unsolved problems in geometry
- Packing rectangles into the unit square
- Partitioning a square into rectangles: NP-Completeness and approximation algorithms
- A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
- A New Mathematical-Programming Framework for Facility-Layout Design
- Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
- The Decomposition of a Rectangle into Rectangles of Minimal Perimeter
This page was built for publication: PACKING SOFT RECTANGLES
