Mathematisch-Naturwissenschaftliche Fakultät: Suche
Anzeige der Dokumente 1-1 von 1
Approximation Algorithms for the Traveling Salesman Problem
(2021-05-11)
The traveling salesman problem (TSP) is probably one of the best-studied problems in discrete optimization. Given a complete weighted graph with n vertices, the task is to find a tour of minimal length that visits every ...