Share This Article:

Solving a Traveling Salesman Problem with a Flower Structure

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

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

Conflicts of Interest

The authors declare no conflicts of interest.

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.

References

[1] Ruohonen, K. (2013) Graph Theory.
[2] Ming, Y.-K., Sanghi, M. and Bernstein, D.J. (2006) An Approximation Algorithm for Bottleneck Traveling Salesman Problem. Lecture Notes in Computer Science, 3998, 223-235.
[3] Carlier, J. and Pinson, E. (1989) An Algorithm for Solving the Job-Shop Problem. Management Science, 35, 164-176.
[4] Estatico, C. (2012) Sistemi Lineari: Algoritmo di Gauss, Lecture Notes Based on Notes of Prof. Marco Gaviano. University of Genova, Genova.
[5] Santini, G. and Varsi, A. (2010/2011) Algoritmi Iterativi per sistemi lineari ed equazioni non lineari. University of Cagliari, Cagliari.

  
comments powered by Disqus

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.