by sethb@[EMAIL PROTECTED]
(Seth)
Mar 20, 2008 at 07:22 PM
In article <WuydncUdgIRJt0DanZ2dnUVZ_jmdnZ2d@[EMAIL PROTECTED]
>,
Doug White <gwhite@[EMAIL PROTECTED]
> wrote:
>Other than doing a Monte Carlo routine or an exhaustive search (which can
>get pretty messy), I haven't come up with a tidy algorithm.
The general problem is NP-complete.
> It should (I think) be possible to come up with a function that
>gets called iteratively (possibly by itself) to chase down the best
>combinations, but that's about where my brain starts hurting.
There are heuristics, often of bounded badness.
There are solvable special cases.
Seth
