TITLE:
Solving a Traveling Salesman Problem with a Flower Structure
AUTHORS:
Gabriele Martino
KEYWORDS:
Traveling Salesman Problem, Polyhedron, Flower, NP-Complete
JOURNAL NAME:
Journal of Applied Mathematics and Physics,
Vol.2 No.7,
June
25,
2014
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 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).