The traveling salesman problem (TSP) has commanded much attention from mathematicians and computer scientists specifically because it is so easy to describe and so difficult to solve. In this paper the problem is defined, various solutiona approaches are discussed and some applications are described.
Traveling Salesman Problem
Rinaldi G
2013
Abstract
The traveling salesman problem (TSP) has commanded much attention from mathematicians and computer scientists specifically because it is so easy to describe and so difficult to solve. In this paper the problem is defined, various solutiona approaches are discussed and some applications are described.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
