On Dec 8, 2009, at 8:29 AM, Geert Janssens wrote:
Thank you for your reply.
Unfortunately, I don't have any experience with this kind of
mathematics. I
don't understand what the wiki page tries to tell me.
Please don't misinterpret his, but I simply don't have the time to
learn a)
how to interpret the math description on wikipedia and b) how that
translates
into a new environment for me. I tried what I could, but just like all
volunteers on this list, my time is limited. I do have a practical
use for a
subset sum solving algorithm and R seems like a quite capable
package. But for
my novice eyes it looks I'll need to understand more of it than
entering a
simple formula which needs time I currently don't have.
Dangerously close to:
library(fortunes)
fortune("brain surgery")
That's why I asked if someone had solved it before, and was willing
to share
his/her program with me. I would be very grateful if someone can
help me here.
An implementation was described in the last few months on this list.
Regards,
Geert
On Monday 7 December 2009, guohao.hu...@gmail.com wrote:
The problem is NP-Complete and the real problem is how you can
solve it.
According to the wiki page, you can use the bottom
algorithm(Polynomial
time approximate algorithm) to solve your problems.
If you had trouble with writing R code, you can read ``R-
introduction''.
regards
Guo-Hao Huang
David Winsemius, MD
Heritage Laboratories
West Hartford, CT
______________________________________________
R-help@r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-help
PLEASE do read the posting guide http://www.R-project.org/posting-guide.html
and provide commented, minimal, self-contained, reproducible code.
