Skip to main content
Artificial Intelligence

Return to Answer

added 68 characters in body
Source Link
nbro
nbro
  • 41.4k
  • 12
  • 114
  • 205

To the best of my knowledge, there isn't any difference between the algorithmic methods and the NN methods. Those that can solve in polynomial time do not give a precise solution. Those that do give a precise solution do not solve in polynomial time. Of those that give a precise solution, the fastest takes 2^Nth$2^N$, but it blows up in terms of memory. The fastest good algorithm I believe is ConcordeConcorde.

The efficient algorithms solve in polynomial time, don't blow up in terms of memory, and give a solution close to perfect, say, within 2-3%. Again, to the best of my knowledge, no NN has beatbeaten the best algorithmic solutions, but there are suggestions that some NN solution could be faster.

To the best of my knowledge there isn't any difference between the algorithmic methods and the NN methods. Those that can solve in polynomial time do not give a precise solution. Those that do give a precise solution do not solve in polynomial time. Of those that give a precise solution the fastest takes 2^Nth, but it blows up in terms of memory. The fastest good algorithm I believe is Concorde.

The efficient algorithms solve in polynomial time, don't blow up in terms of memory, and give a solution close to perfect, say, within 2-3%. Again, to the best of my knowledge, no NN has beat the best algorithmic solutions, but there are suggestions that some NN solution could be faster.

To the best of my knowledge, there isn't any difference between the algorithmic methods and the NN methods. Those that can solve in polynomial time do not give a precise solution. Those that do give a precise solution do not solve in polynomial time. Of those that give a precise solution, the fastest takes $2^N$, but it blows up in terms of memory. The fastest good algorithm I believe is Concorde.

The efficient algorithms solve in polynomial time, don't blow up in terms of memory, and give a solution close to perfect, say, within 2-3%. Again, to the best of my knowledge, no NN has beaten the best algorithmic solutions, but there are suggestions that some NN solution could be faster.

Source Link
scientious
scientious
  • 281
  • 1
  • 4

To the best of my knowledge there isn't any difference between the algorithmic methods and the NN methods. Those that can solve in polynomial time do not give a precise solution. Those that do give a precise solution do not solve in polynomial time. Of those that give a precise solution the fastest takes 2^Nth, but it blows up in terms of memory. The fastest good algorithm I believe is Concorde.

The efficient algorithms solve in polynomial time, don't blow up in terms of memory, and give a solution close to perfect, say, within 2-3%. Again, to the best of my knowledge, no NN has beat the best algorithmic solutions, but there are suggestions that some NN solution could be faster.