> -----Original Message-----
> From: mi400-bounces@xxxxxxxxxxxx / David Morris
> Sent: Monday, September 20, 2004 12:03 PM
>
> Here is another non-MI answer. The problem you are trying to solve is
> NP complete.

Interesting.  I'm glad there's a name for it. <g>  Reading up on it, it
appears that this particular problem can be more aptly called a "subset sum
problem":
http://en.wikipedia.org/wiki/Subset_sum_problem

Well, that'll have to be free-time reading, if I get to that point.  I think
I have hit upon an idea (as outlined in a previous post) that will get
results in a fair amount of time.

db


As an Amazon Associate we earn from qualifying purchases.

This thread ...

Replies:

Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2022 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.