Statistical Science, Vol. 8, No. 1, Report from the Committee on Applied and Theoretical Statistics of the National Research Council on Probability and Algorithms (Feb., 1993), pp. 48-56 (9 pages) ...
The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback