This is the problem facing a salesman who needs to travel to a number of cities and get back home. Given the cities (and their locations), the challenge is to find the shortest possible
http://www.quora.com/TravelingSalesmanProblem/Wh...

( ¦trav·əl·iŋ ′sālz·mən ′präb·ləm ) (mathematics) The problem of performing successively a number of tasks
http://www.answers.com/topic/travelingsalesmanpr...

The program TravSalm applies a circular Kohonen map to the
http://www.chacha.com/question/whatisthesolutio...

Branch and bound is a systematic search, and is a complete algorithm. Using B&B, tours are systematically made and 'bounds' are put on what is acceptable. If the current partial
http://answers.yahoo.com/question/index?qid=200705...
