Looping problem

[Glen Bojsza]

Dar / Alex,

Thanks for the feedback... it makes me feel much better knowing the
problem is actually difficult.

I will do some research and hopefully get something close which is acceptable.

regards,

On 6/20/05, Dar Scott <dsc at swcp.com> wrote:
> 
> On Jun 20, 2005, at 5:01 PM, Glen Bojsza wrote:
> 
> > The scope is to have a number of locations and the minimum path
> > connecting the locations.
> 
> This looks like it might be a variation on the traveling salesman
> problem and you might find lots of references to approaches to
> solutions to that.
> 
> Dar
> --
> **********************************************
>      DSC (Dar Scott Consulting & Dar's Lab)
>      http://www.swcp.com/dsc/
>      Programming and software
> **********************************************
> 
> _______________________________________________
> use-revolution mailing list
> use-revolution at lists.runrev.com
> Please visit this url to subscribe, unsubscribe and manage your subscription preferences:
> http://lists.runrev.com/mailman/listinfo/use-revolution
>