Yasmin Hoadjli

Learn More
The solution of NP-hard problems requires the use of one or more explicit or implicit heuristics as a practical measure. Quantum computers promise to make this practical for O (2<sup>n</sup>) problems or less, but have yet to deliver a solution to a single NP-hard problem. The question addressed by this paper is whether domain transference and reuse of(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