%0 Journal Article %T Solving a Traveling Salesman Problem with a Flower Structure %A Gabriele Martino %J Journal of Applied Mathematics and Physics %P 718-722 %@ 2327-4379 %D 2014 %I Scientific Research Publishing %R 10.4236/jamp.2014.27079 %X

This works aims to give an answer to the problem P = NP? The result is positive with the criteria that solve the Traveling Salesman Problem 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).

%K Traveling Salesman Problem %K Polyhedron %K Flower %K NP-Complete %U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=47225