Editing Packing problems (section)

===Packing of rectangles===
{{main article|Rectangle packing}}

* '''Packing identical rectangles in a rectangle''': The problem of packing multiple instances of a single [[rectangle]] of size {{math|(''l'',''w'')}}, allowing for 90° rotation, in a bigger rectangle of size {{math|(''L'',''W'' )}} has some applications such as loading of boxes on pallets and, specifically, [[woodpulp]] stowage. For example, it is possible to pack 147 rectangles of size (137,95) in a rectangle of size (1600,1230).
* '''Packing different rectangles in a rectangle''': The problem of packing multiple rectangles of varying widths and heights in an enclosing rectangle of minimum [[area]] (but with no boundaries on the enclosing rectangle's width or height) has an important application in combining images into a single larger image. A web page that loads a single larger image often renders faster in the browser than the same page loading multiple small images, due to the overhead involved in requesting each image from the web server. The problem is [[NP-complete]] in general, but there are fast algorithms for solving small instances.