A class of greedy algorithms for solving the travelling salesman problem /
The travelling salesman problem is one of the NP-complete problems. It has been under consideration in computer science for at least forty years. Solving this hard problem using search methods can be accomplished by choosing: a starting point, a solution generation scheme and a termination rule. Whe...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
McGill University
1990
|
| Subjects: | |
| Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=59557 |