Solving a Traveling Salesman Problem with a Flower Structure  

作　　者：Gabriele Martino 

机构地区：[1]Rome, Italy

出　　处：《Journal of Applied Mathematics and Physics》2014年第7期718-722,共5页应用数学与应用物理（英文）

摘　　要：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).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).

关 键 词：TRAVELING SALESMAN Problem POLYHEDRON FLOWER NP-COMPLETE 

分 类 号：O1[理学—数学]