Approximate algorithms in traveling selsman problem

Author: Giorgi Shavadze
Co-authors: Giorgi Shavadze
Keywords: TSP
Annotation:

Constructing issues of approximate solution for TSP tasks are discussed in the work. Particularly, “Nearest Neighbor algorithm”, “choose the least arch” and some generalization of local search “2-opt solution” type heuristics are actualized for famous test examples; Analyze of results of number experiments are provided.

Lecture files:

მიახლოებითი ალგორითმები კომივოიაჟერის ამოცანაში [ka]