| 230 | | * Local search crashes if a TSP instance with less than 4 cities is solved |
| 231 | | * swinkler: It seems to me that this problem occurs a TSP instance with less than 3 cities is solved |
| 232 | | * abeham: I would argue that there does not exist a Traveling Salesman *Problem* with 3 or less cities. |
| 233 | | * swinkler: Yes, on the one hand you're right here, but on the other hand one could also argue that that's an optimization problem that is really easy to solve. That's why I think that the algorithm should not crash whensolving a TSP with 3, 2, or even one city. |
