#traveling-salesman

Follow to get notified about new posts with this tag

edicted

3y

Brute Force Debacle: (P)olynomial vs NP

Brute Force Debacle: (P)olynomial vs NP

52 choose 5: I'll take a royal flush please.

$ 61.978

497

akadal

9y

!Low reputation account with an unverified outbound link, Reveal content

Solving Traveling Salesman Problem with Genetic Algorithm on Real World Map!

Solving Traveling Salesman Problem with Genetic Algorithm on Real World Map!

Traveling Salesman is one of the classic NP-Hard problems: finding the optimal solution can take a long time. It is easy to see the solution for a small number of cities: you just look at all the possible

$ 0.000

4