Rectangle packing with additional restrictions
From MaRDI portal
(Redirected from Publication:650936)
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
Cites work
- scientific article; zbMATH DE number 1226257 (Why is no real title available?)
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- A Theorem of Sylvester and Schur
- A generalization of a theorem of Kleitman and Krieger
- A new constraint programming approach for the orthogonal packing problem
- A new exact method for the two-dimensional orthogonal packing problem
- A typology of cutting and packing problems
- An improved typology of cutting and packing problems
- Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity
- MPQ-trees for orthogonal packing problem
- On packing of squares and cubes
- On packing squares into a rectangle
- Optimal rectangle packing
- Reducibility among combinatorial problems
- Some packing and covering theorems
Cited in
(5)
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)