Re: Equalize Stack Algorithm



Eric <ericgorr@xxxxxxxxx> writes:

Let's say that you have n items each each with a height h and you want
to place these items into x stacks (each item will be placed on top of
another) and end up with each stacks as close to the same height as
possible.

What would this algorithm look like?

I assume this kind of thing has been solved before, so a book
reference or URL would be sufficient. I've looked, but haven't found
anything yet.

The problem is called "1D bin packing" (there are 2D and 3D variants).


Have a look at:

http://209.85.229.132/search?q=cache:jtFRCacaCM8J:www.cs.arizona.edu/icon/oddsends/bpack/bpack.htm+1d+bin+packing&cd=3&hl=en&ct=clnk&ie=UTF-8


--
__Pascal Bourguignon__
.