Changes between Version 7 and Version 8 of Documentation/Reference/Traveling Salesman Problem


Ignore:
Timestamp:
06/30/14 00:50:56 (5 years ago)
Author:
abeham
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • Documentation/Reference/Traveling Salesman Problem

    v7 v8  
    1 = Travelling Salesman Problem =
     1= Traveling Salesman Problem =
    22The traveling salesman problem (TSP) is certainly one of the classical as well as most frequently analyzed representatives of combinatorial optimization problems with a lot of solution methodologies and solution manipulation operators. The problem is that a person has to visit a number of cities starting from and returning to his home city. The goal is to find a tour where every city is visited exactly once and where the travel distances become minimal.
    33