I have the impression that a little branch and bound with just the 3 or 4 shortest edges per node (instead of just one) would quickly produce much better results.
Prove it! (You've done a great job of quoting wikipedia; how about putting some of your reading into practice?)
In reply to Re^4: Travelling problem (Anyone better 86850?)
by BrowserUk
in thread Travelling problem
by Dirk80
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |