Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Travelling Salesman Problems

by tedv (Pilgrim)
on Nov 08, 2000 at 23:40 UTC ( #40611=note: print w/replies, xml ) Need Help??


in reply to Graph Traversal

If you want some good insight into travelling salesman problems, try playing the board game Elflands by Alan Moon. I've only played it a few times, but I'm sure that after 10 games, I'd have a much better feel for coming up with an adequate TSP solution. Note that the perfect TSP solution is an NP complete problem, so don't aim for the optimal solution. Aim for "good enough".

-Ted

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://40611]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (6)
As of 2017-11-18 12:42 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    In order to be able to say "I know Perl", you must have:













    Results (277 votes). Check out past polls.

    Notices?