Share This Article:

Solving a Traveling Salesman Problem with a Flower Structure

Full-Text HTML Download Download as PDF (Size:856KB) PP. 718-722
DOI: 10.4236/jamp.2014.27079    2,769 Downloads   3,854 Views Citations
Author(s)

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).

Cite this paper

Martino, G. (2014) Solving a Traveling Salesman Problem with a Flower Structure. Journal of Applied Mathematics and Physics, 2, 718-722. doi: 10.4236/jamp.2014.27079.

Copyright © 2019 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.