-
Notifications
You must be signed in to change notification settings - Fork 0
The covering salesman problem (CSP) is a generalization of the TSP in which we have to satisfy all the customers’ demand by visiting them.The goal of the CSP is to construct a minimum length tour over a subset of the given customers such that each customer,not visited on the tour, is within the covering distance of at least one visiting customer.
thuanbui-1203/GENERALISED-COVERING-TRAVELLING-SALESMAN-PROBLEM
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
About
The covering salesman problem (CSP) is a generalization of the TSP in which we have to satisfy all the customers’ demand by visiting them.The goal of the CSP is to construct a minimum length tour over a subset of the given customers such that each customer,not visited on the tour, is within the covering distance of at least one visiting customer.
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published
Languages
- Python 100.0%