Skip to content

godinhojoao/TSP-Approximation-Algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

TSP Metric

  • Exact solution:
    1. brute force
    2. branch and bound
  • Approximation algorithm (2-optimal) 1.nearest insertion

How to run:

  • make run OR
  • g++ -std=c++17 -O2 -I src src/main.cpp src/Graph/Graph.cpp -o main && ./main

About

This repository contains both exact and approximation algorithms to solve the Traveling Salesman Problem. It was developed as part of the DSA III course at the Federal University of Pelotas.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors