The traveling salesman problem is at the heart of an ongoing question???the question???in computer science: whether or not P equals NP. As summarized with blunt elegance by MIT???s news office, ???roughly speaking, P is a set of relatively easy problems, NP is a set of incredibly hard problems, and if they???re equal, then a large number of computer science problems that seem to be incredibly hard