Subject: BIN Packing Problem
i'am serching an algorithm to solve this problem:
There are a several pieces of an article (think of apples). There are
types of boxes to pack the articles in. There can different sizes of
boxes if there are other articles.
How the get the best count of boxes of each size.
7 apples, boxtypes are 3-size and 2-size.
Getting 2x 3s and 1x2s would remain 1 piece over.
Best would be: 1x3s and 2x2s boxes wich remains non rest.
16 oranges, boxtypes are 20-size, 3-size and 2-size.
Best Fit: 0x20s and 4x3s and 2x2s
Thanks in advance,
View All Messages in comp.graphics.algorithms
Re: BIN Packing Problem
Copyright © 2006 WatermarkFactory.com. All Rights Reserved.