Simulated annealing and graph embedding
To solve the TSP, we were dealing with a graph while ignoring its embedding,[1] the only thing that mattered was the distance between pair of vertices. In the last couple of chapters, we focused on abstract graphs and finding meaningful ways to embed them in the plane. If you recall, when we presented simulated annealing, [ [ ...]