ºÝºÝߣ

Ha Noi, Vietnam

Let C be a set of m cities with distances d(c_i,c_j) element Z^+ for each pair of cities c_i, c_j element C, and let B be a positive integer. Then is there a tour of C having length B or less, i.e., a permutation <c_(pi[1]), c_(pi[2]), ..., c_(pi[m