title: Tiling different size rectangles
body: <p>I am looking for some pointers to algorithms that should allow to tile with no overlap different size rectangles.</p>
  
  <p>Given a set of different sized rectangles, tile them on an area of size H x W with no overlap. The objective would be to maximize the space used or conversely - minimize area of gaps. If there is not enough space, proceed on the second area of the same size and so on.</p>
  
  <p>It is assumed that each rectangle's width and height are smaller than respective dimensions of the tiling area. Rectangles are not rotated or otherwise transformed - i.e. their sides are either horizontal or vertical.</p>
  
  <p>I am not looking for finished code, just curious what approaches/algorithms are the best to use to solve this problem.</p>