Comments by Juan Carlos Arburua (Top 1 by date)

It was a misunderstanding, I clarify that my idea was not to ask for a program. I expressed myself incorrectly: the question itself is to know which is the O(n) of the program that most quickly solves the TSP problem exactly without using dynamic programming. I found several articles but most were done with heuristics or dynamic programming.
Thank you.