marinimau / ds_travelling_salesman_problem_solved_as_max_flow

Implementation of an exact algorithm to resolve symmetric instances of the TSP problem using Maximum Flow for the constraints generation.

[DS] Travelling Salesman Problem solved using Maximum Flow Problem

Implementation of an optimal algorithm to resolve symmetric instances of the TSP problem.

Instruction

1. clone this repository

git clone https://github.com/marinimau/ds_travelling_salesman_problem_solved_as_max_flow.git

2. create a virtual env and activate it

cd ds_travelling_salesman_problem_solved_as_max_flow
python3 -m venv venv
source venv/bin/activate

3. install requirements

pip3 install -r requirements.txt

4. run the code

python3 main.py

Author

Mauro Marini