Update2: Re-re-reading the OP, I now understand the question. I did make a bad assumption. :-)
Update: This node is based on the assumption that the bins have a maximum size. If that assumption is invalid, and the task is to create a set of unordered combinations, then this post is not a solution (well, the fitness function is trivial). See blokhead's comment below.
This is a bin packing algorithm, but you are looking for all solutions, not just the best solution. This is a theory problem.
See also the knapsack problem, travelling salesman problem, and other examples of this class of problem.
--MidLifeXis
In reply to Re: x objects in y containers where all objects are used
by MidLifeXis
in thread x objects in y containers where all objects are used
by Ectaris
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |