Let $D=(d_{ij})$ be the n × n distance matrix of a set of n cities {1, 2,..., n}, and let T be a PQ-tree with node degree bounded by d that represents a set II(T) of ...
This is a preview. Log in through your library . Abstract We consider partitioning algorithms for the approximate solution of large instances of the traveling-salesman problem in the plane. These ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback