GitHub - diegolrs/TSP-Solver at 680d09458c240b1c09053d21b454d445b698ec86

diegolrs / TSP-Solver Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

This repository contains an implementation of the Traveling Salesman Problem (TSP) solver using C++. The TSP is a classic algorithmic problem in the fields of computer science and operations research. The goal is to find the shortest possible route that visits a set of cities and returns to the origin city, visiting each city exactly once.

0 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 7 Commits
instances		instances
src		src
.gitignore		.gitignore
makefile		makefile
tsp		tsp

About

This repository contains an implementation of the Traveling Salesman Problem (TSP) solver using C++. The TSP is a classic algorithmic problem in the fields of computer science and operations research. The goal is to find the shortest possible route that visits a set of cities and returns to the origin city, visiting each city exactly once.

graph-theory route-optimization algorithm-design traveling-salesman-problem optimization-techniques

Report repository

Releases

No releases published

Packages

No packages published

Languages