Which of the following statements are true concerning the Traveling Salesman Problem? (You may check more than one choice)

a) The solution will always be different depending on the start node

b) The nearest neighbor heuristic is very fast, but not guaranteed to provide an optimal tour

correct

c) The nearest neighbor heuristic is a construction algorithm.

correct

d) The nearest neighbor heuristic is an improvement algorithm.

e) If N is the number of nodes in the network, then there will be N arcs in