Read full paper at: http://www.scirp.org/journal/PaperInformation.aspx?PaperID=47225#.VFwy0mfHRK0 Author(s) Gabriele Martino Affiliation(s) Rome, Italy . ABSTRACT This works aims to give an answer to the problem P = NP? The result is positive with the criteria that solve the Traveling Salesman Proble m in polynomial cost of the input size and a proof is given. This problem gets a solution because a polyhedron, with a cut flower looking, is introduced instead of graph (e.g. tree). KEYWORDS Traveling Salesman Problem , Polyhedron , Flower , NP-Complete Cite this paper ...
Scientific Research Publishing