lemonade的专栏

The Traveling Salesman Problem (TSP)Find the shortest trip through n towns where each town must be visited exactly once.In the following we define that from each town all other towns can be

  Intelligent Systems Group, Department of Computer Science, University College London, Gower St., London WC1E 6BT, UK.Tel. +44 (0)171 391 1329 Fax. +44 (0)171 387 1397E-mail: P.Bentley@cs.ucl