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 the traveling salesman problem asks if there is a tour of C having length B or less, i.e., a permutation of C such that sum_(i=1)^(m - 1)d(c_π(i), c_π(i + 1)) + d(c_π(m), c_π(1))<=B.

TSP

status | proved NP-complete

NP complete problems | NP problems | mathematical problems | solved mathematics problems