# name
Different approaches to Travelling Salesman Problem

# metadata.dc.description[].value
Treballs Finals de Grau de Matemàtiques, Facultat de Matemàtiques, Universitat de Barcelona, Any: 2022, Director: Eloi Sans Gispert

# metadata.dc.description.abstract[].value
[en] This thesis is a comparison of some to solve the Travelling Salesman Problem. The approach for the analysis by coding and compering the result. Starting with the most primitive Brute Force Algorithm and going through more creative and innovative ones, there is presented how do they work, a pseudo-code the mathematical theory hidden behind each of them. The objective is to compare and evaluate the pros and cons on different scenarios of the Salesman Travelling Problem.

# metadata.dc.rights[].value
cc-by-nc-nd (c) Roger Nogales Giné, 2022

# metadata.dc.source[].value
Treballs Finals de Grau (TFG) - Matemàtiques

# metadata.dc.title[].value
Different approaches to Travelling Salesman Problem