3 ms·

Interesting! It looks like none of them are optimal. Is this an NP-hard problem?

• Keyframe 16y ago
  That is an NP-hard problem. http://en.wikipedia.org/wiki/Bin_packing_problem http://en.wikipedia.org/wiki/Bin_packing_problem
  • kiuyhjk 16y ago
    The optimal solution then is to get an infinite number of people on the internet to solve it for you for free!
    • terraflop 16y ago
      Its an np-hard problem! Definitiv! And this is exactly what i thought!
• stevejohnson 16y ago
  Yes, there are several papers on the subject. I found a few by searching "rectangle packing algorithm."
  • harpastum 16y ago
    Although I didn't read it until after I had created my solutions, I found Andrea Lodi's paper [1] very interesting. It wasn't quite the approach I used, but it's a pretty thorough explanation of the problem and possible solutions. [1] PDF http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.98.3502&rep=rep1&type=pdf http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.98....