What is the Traveling Salesman Problem?

[@pamward7579]

I often use real-world examples to explain to my middle school math students why some of the more arcane things we do have applications. This video is really terrific and even my six graders understood it. They always ask what they’re ever going to do with some of the math subjects we cover, and now I can show them something practical.

[@mehmetalikeskin6467]

Kargoman ?

[@riyamani8161]

The traveling salesman problem allows us to find the shortest or the longest path used to travel to all the given areas once and return to the starting point. There are various methods used to find this out. There is no perfect solution but an optimal solution can be selected and implemented.

[@neerajmahapatra5239]

This is amazing video! Lots of you tubers just start teaching the logic and solving the problem without stating the usage of the problem by relating it to real life scenarios.

[@wolfinthesuit]

Enroll in IT they said, it will be easy they said

[@adityabehera3982]

Traveling Salesman Problem allows us to choose an optimal path, for example, when we need a school bus to visit many different houses in a city.

[@Jkauppa]

try sorting all edge lengths, amount ½n^2, n is location count, then try the permutations until you have a guaranteed shortest loop path

[@Jkauppa]

so you travel edges, not permutating the target (cities, locations)

[@Jkauppa]

it gives even more permutations to test, but gives an actual solution

[@Jkauppa]

graph theory solution

[@Jkauppa]

try djisktra shortest path algorithm, breadth first on all location starting points

[@Jkauppa]

please note, not all permutations are unique routes

[@kloassie]

Explain the christofian 1.5 solution and give an heuristic example as well please

[@willjadsonevania9787]

teacher I developed a heuristic and would like to share it. My heuristic uses topology and concentric circles. What do you think?.

[@bastiyourdeveloper5744]

Hi - perfect video - nice pics :-)
Just FYI: the current fastest exact Algorithm is: Bellmann-Held-Karp O(2^n)

[@Bioassasin01]

Wait... this makes no sense, why did you cut out the part with the farmer and the 3 holes in the wall?

[@thatgameguy4929]

Have you tried slime mold?

[@marcusaurelius8030]

how the hell is this O(n!) ??

[@larubiano0]

Nice thanks

[@johnstfleur3987]

YES.

[@EXEFaker]

Imagine being a Salesman and this actually happens (I k it can happen irl on godddd it's a joke)

[@EighthHouseTarot]

THIS GUY'S VOICE NEEDS TO BE LESS MOISTURE-SMACKING

[@Ma_rkw589]

Euuuugh god I know

[@kaanakgul9691]

drink some water man

[@abdullahguibali2529]

u can say thanks instead of this

[@dimitrijmaslov1209]

.

[@aleksszukovskis2074]

first