The problem of the traveling salesman is a well-known problem in discrete mathematics and these are 2 methods of solving: D-algorithm and Heuristic method.
-
Notifications
You must be signed in to change notification settings - Fork 0
LukaSimovic/The-travelling-salesman-problem
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
The problem of the traveling salesman is a well-known problem in discrete mathematics and these are 2 methods of solving: D-algorithm and Heuristic method.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published