Development of a dummy guided formulation and exact solution method for TSP
A traveling salesman problem (TSP) is a problem whereby the salesman starts from an origin node and returns to it in such a way that every node in the network of nodes is visited once and that the total distance travelled is minimized. An efficient algorithm for the TSP is believed not to exist. The...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
PC Technology Center
2020-06-01
|
| Series: | Eastern-European Journal of Enterprise Technologies |
| Subjects: | |
| Online Access: | http://journals.uran.ua/eejet/article/view/203865 |