Problem description: Given a rectangular array of data we want to display them in a table of given width W and minimal height H. Some data items take more space than others. I can live with the simplifying assumption that the space requirement of the item can be expressed in terms of an area aij.
More formally, find positive w1+...+wm=W minimizing H=h1+...+hn subject to aij <= hiwj
This feels like a standard problem to me but I wasn't able to find much on it.
My question is:
Is this indeed a standard problem? I.e. does it have a name? Is it a hard problem? Are there textbook algorithms for solving it?