Authors: A. A. Frempong
The traveling salesman can determine by hand, with zero or negligible error, the shortest route from home base city to visit once, each of three cities, 10 cities, 20 cities, 100 cities, or 1000 cities, and return to the home base city. The general approach to solving the different types of NP problems is the same, except that sometimes, specific techniques may differ from each other according to the process involved in the problem. In the salesman problem, the first step is to arrange the data in the problem in increasing order, since one's interest is in the shortest distances. The main principle here is that the shortest route is the sum of the shortest distances such that the salesman visits each city once and returns to the starting city. The approach in this paper is different from the author's previous approach (viXra:1505.0167) in which the needed distances not among the least ten distances were added to the least ten distances before route construction began. In this paper, one starts with only the least ten distances and only if a needed distance is not among the set of the least ten distances, would one consider distances greater than those in the set of the ten least distances. The shortest route to visit nine cities and return to the starting city was found in this paper. It was also found out that even though the length of the shortest route is unique, the sequence of the cities involved is not unique. The approach used in this paper can be applied in workforce project management and hiring, as well as in a country's workforce needs and immigration quota determination. Since an approach that solves one of these problems can also solve other NP problems, and the traveling salesman problem has been solved, all NP problems can be solved, provided that one has an open mind and continues to think. If all NP problems can be solved, then all NP problems are P problems and therefore, P is equal to NP. The CMI Millennium Prize requirements have been satisfied
Comments: 12 Pages. Copyright © by A. A. Frempong
Unique-IP document downloads: 75 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.