Subj : Re: efficient way of processing m combinations of n numbers in p sets
To   : comp.programming
From : Mike
Date : Tue Aug 16 2005 09:09 am

I think the problem is one of minimization (n horses with fixed odds,
placing variable bets on each and finding the best "loss" after taking
into account total cost for placing a bet on each)
Thanks for the search pointers.  I had a look at combinatorial
optimization and simulated annealing which seem a likely solution, but
being able to apply these to this scenario may be tricky for me :-)
Mike.

.