Can I read TSP Heuristics and Approximation Methods on EtoBox?

TSP Heuristics and Approximation Methods by Brian Xistos is a document available to read on EtoBox.

What is TSP Heuristics and Approximation Methods about?

The nearest neighbor heuristic is a construction heuristic for solving the traveling salesman problem. It works by starting at some initial vertex, selecting the closest unvisited neighbor at each step, and moving to that neighbor. It continues selecting and moving to the closest unvisited neighbor until all vertices have been visited, at which point it returns to the initial vertex to complete the tour.

Author

Brian Xistos

Language

EN