Approximation for optimum value of Travelling Salesman Problem using by Christofides Algorithm. The algorithm is designed for input size range from 1k to 30k. The algorithm can come up with an approximation within 15% range of the true optimim value.
-
Notifications
You must be signed in to change notification settings - Fork 0
ahmetlekesiz/tsp-approximation
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Traveling Salesman Problem Approximation Christofides Algorithm
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published