RE: [PHP] Looking for help with a complex algorithm
| From: | Per Jessen | Date: | Wed, 10 Oct 2007 08:49:42 +0000 |
| Subject: | RE: [PHP] Looking for help with a complex algorithm | ||
| References: | 1 2 | Groups: | php.general |
| Request: | Send a blank email to php-general+get-263023@lists.php.net to get a copy of this message | ||
Robert Cummings wrote:
> On Tue, 2007-10-09 at 15:28 -0500, Jay Blanchard wrote:
>> [snip]
>> This *IS* the knapsack problem. Just because you specify date ranges
>> to get your values and the value isn't a knapsack doesn't change the
>> fact that it is the same problem :) I remember having fun with
>> genetic algorithms and the knapsack problem back in University.
>> [/snip]
>>
>> You're right save for the knapsack problem considered not only
>> volume, but value as well.
>
> So imagine the value of all of your items is equal to it's size.
> Voila, same problem.
>
Which means it surely been solved before:
http://en.wikipedia.org/wiki/Knapsack_problem
I've never heard of it either, but it sounds a lot like the travelling
salesman problem?
/Per Jessen, Zürich