Consider the symmetric traveling salesman problem with the graph shown in Fig. 10.16.
(a) Find a suboptimal solution using the nearest neighbor heuristic starting from node 1.
(b) Find a suboptimal solution by first solving an assignment problem, and by then merging subtours.
(c) Try to improve the solutions found in (a) and (b) by using the 2-OPT heuristic
