Zahira Ghalem

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The Traveling Salesman Problem (TSP) was first formulated in 1930 and is one of the most studied problems in optimization. If the optimal solution to the TSP can be found in polynomial time, it would then follow that every NP-hard problem could be solved in polynomial time, proving P=NP. It will be shown that our algorithm finds P~NP with scale. Using a(More)
  • 1