I'd say partition problem (optimization variant with N partitions, ie the worst kind) rather than Knapsack, but otherwise the conclusion is pretty much the same. This means that while finding the best solution is easy (test all combinations, keep the best one), doing so in reasonable time is worth 1 million. Your "intuitive winner" looks like a pretty good approximation.
For what I understand of neural networks, I don't think they are relevant for this kind of problems. This is neither extracting information (the data size of the output, ie an ordering of your elements, is the same as the input), nor a classification problem (an element isn't sent to a set according to its properties alone, but to the properties of all the elements in the input).
In reply to Re: Proportional distribution of indivisible items
by Eily
in thread Proportional distribution of indivisible items
by anonymized user 468275
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |