Travelling Salesman Problem

Problem Definition

Given $n$ cities, and a nonnegative integer distance $l$ between any two cities. Asked to determine if there is a tour of all cities with total distance no more than $K$.