Comparing Greedy Constructive Heuristic Subtour Elimination Methods for the Traveling Salesman Problem

Petar D. Jackovich, Bruce A. Cox, Raymond R. Hill

This paper further defines the class of fragment constructive heuristics used to compute feasible solutions for the Traveling Salesman Problem into arc-greedy and node-greedy subcl…