Rectangle packing with additional restrictions
From MaRDI portal
Publication:650936
DOI10.1016/J.TCS.2011.09.007zbMATH Open1227.68032OpenAlexW1966475068MaRDI QIDQ650936FDOQ650936
Authors: Jens Maßberg, Jan Schneider 
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.09.007
Recommendations
- Packing rectangles into a rectangle
- On packing of rectangles in a rectangle
- Packing unit squares in a rectangle
- Packing rectangles into the unit square
- Packing rectangles and intervals∗
- Optimal rectangle packing
- Packing rectangles in a strip
- scientific article; zbMATH DE number 2042238
- Packing squares into a rectangle with a relatively small area
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- An improved typology of cutting and packing problems
- Title not available (Why is that?)
- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
- A typology of cutting and packing problems
- A new exact method for the two-dimensional orthogonal packing problem
- On packing of squares and cubes
- Optimal rectangle packing
- A new constraint programming approach for the orthogonal packing problem
- Reducibility among combinatorial problems
- Some packing and covering theorems
- Title not available (Why is that?)
- On packing squares into a rectangle
- A GENERALIZATION OF A THEOREM OF KLEITMAN AND KRIEGER
- MPQ-trees for orthogonal packing problem
- A Theorem of Sylvester and Schur
Cited In (1)
This page was built for publication: Rectangle packing with additional restrictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650936)
