| Article ID: | iaor1994691 |
| Country: | Brazil |
| Volume: | 2 |
| Issue: | 3 |
| Start Page Number: | 221 |
| End Page Number: | 242 |
| Publication Date: | Jun 1992 |
| Journal: | Investigacin Operativa |
| Authors: | Campello R.E. |
| Keywords: | graphs, programming: travelling salesman |
This and a companion paper (Part I) describe the main heuristics for the symmetric traveling Salesman Problem, its time complexities and worst case bounds. In this paper (Part II) partitioning heuristics for large scale graphs are reviewed and it also addresses the question of guaranteed performance heuristics for the MinMax version of the Traveling Salesman Problem.