Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
The traveling salesman problem: algorithms, sub-tours and applications in combinatorial optimization
The importance of the traveling salesman problem (TSP) in combinatorial optimization and its application and adaptability to numerous real-life problems has led to the development of a wide range of algorithms. A major issue in the development of TSP algorithm involves how to handle the large number...
Saved in:
| Format: | Book |
|---|---|
| Published: |
2020
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|