An implementation of a branch-and-cut algorithm for the travelling salesman problem
M.Sc. (Computer Science) === The Travelling Salesman Problem (TSP) comprises the following: A salesman is required, by definition of his job description, to visit a set of cities. He leaves from a base city, visits each of the other cities exactly once and then returns to his base city. In travellin...
| Main Author: | |
|---|---|
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10210/7337 |