Journal of Applied Mathematics and Physics

Volume 2, Issue 7 (June 2014)

ISSN Print: 2327-4352   ISSN Online: 2327-4379

Google-based Impact Factor: 0.63  Citations  

Solving a Traveling Salesman Problem with a Flower Structure

HTML  Download Download as PDF (Size: 856KB)  PP. 718-722  
DOI: 10.4236/jamp.2014.27079    3,127 Downloads   4,309 Views  Citations
Author(s)

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

Share and Cite:

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 © 2020 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.