Hearted Youtube comments on Tom S (@YTomS) channel.

  1. This is so interesting. I am retired now, but the last 20 years of of my working life was spent managing a dynamic truck allocation system in an opencast mine. I was mostly involved in the IT/IM side, but I knew the optimization was done with the simplex algorithm. Over the years, however, I got the impression that all the graduated industrial engineers did not understand what they were working with.I'll rewatch all of this a number of times.
    305
  2. Im impressed by your website and ran hours deep into a mathematical rabbit hole on Wikipedia. Thanks, I unexpectedly learned a lot today! But i noticed that on your website, the description of the maximum independent set problem and minimum vertex cover problem are wrong and mashed together
    285
  3. I took multiple operations research classes in undergrad and I'm taking math graduate classes now. I never truly understood the connection between the primal and the dual problem until now. My mind is blown. Thank you so much!!!!!!!
    181
  4. Perfect pace, well thought of outline, clean and helpful visuals, good narration - what is not to love about this? You've gained a subscriber.
    134
  5. This topic has to be one of the most important things I’ve seen this year. So useful. That’s crazy what you could do with this.
    108
  6. Man, I am happy 3B1B did this contest. I've been clicking on all of the contest videos I could find and the youtube algorithm now understood to suggest videos like yours. Short, simple and well visualized. Well done.
    80
  7. "To fix the problem, we'll avoid it." LOL - best way to deal with any problem! Seriously, great video and I'm not really a computer guy. But you got my vote!
    79
  8. very nicely made video. but somehow the whole loose/tight algorithm didn't really sink in. i have a PhD in engineering and done also courses in (applied) more advanced (for an engineer) math, such as a lot of numerical methods for pde's and differetial geometry, which always rapidly made sense to me. also the fundamental idea of the simplex is very clear, as long as its any kind of polygon, the extremum should always be in the vertex. i also assume, if its a geometrically convex polygon, the local extra will be a global one, thus making the problem convex as well. not sure why the description of the actual algorithm left me in such confusion. maybe because its 2am and im watch this on my phone under my blanket to no wake my wife 😂
    45
  9. Your videos are incredible! Loved the simplicity and the animations. Source code of the video is a big plus!
    33
  10. I used linear programming to solve for optimal production chains in the game Satisfactory! I made an online tool and everything. To be honest I just discovered that it was a well studied class of problems and downloaded a library to do it for me, haha. I knew vaguely there was "something, something simplex method" going on under the hood but I never truly studied the algorithm. Cool to see the geometry of how it actually works!
    28
  11. Thanks for sharing. Your animations are very helpful. I can't wait to use it in the class room. Also thank you for your list of software that you used. The use of AI image generators is an interesting option that I haven't thought of so far.
    27
  12. Thank you for all the work you put in these videos, I really learn a lot with them!
    23
  13. Very vell explained. Thank you for the video.
    20
  14. Seriously, I have not been this excited with a YouTube channel since I discovered 3blue1brown, and that must be about 3 years ago. Sir, what a masterpiece it is. Thanks for sharing it with us.
    19
  15. Oh, you two nerds! You were working together all along, to advertise your videos to eachother. Thank you for doing that; I found two new nerds to follow, instead of just one.
    18
  16. This was my favorite puzzle of AoC '22, not too easy, not too hard, possible to do by partial brute-force, and gives a good chance for going back and optimizing after submitting the answer.
    17
  17. I love your videos! It feels like you explain complex things in a way that really makes them easy to understand. Your content always triggers my interest and I find myself going into rabbit holes online lol. Keep it up!
    15
  18. This content is so advanced. Thank you for the video.
    15
  19. thanks for this beautiful video ^_^
    14
  20. this is my first video of you that I've seen, and it's really amazing. i'm looking forward to seeing more videos in this series.
    12
  21. This is super well organized and visualized! One of the nicest explainers about graphs.
    10
  22. this video is really good and well-explained! The only thing missing is having a few more example mazes for Theseus to dodge the Minotaur, just running through 3 or 4 of them in a few seconds each. It's always fun to unleash an algorithm on a bunch of examples to see if anything interesting happens!
    10
  23. Just started an AI course at my uni, but the professor is so confusing. This was a great introduction to the first few modules of my course thank you!
    9
  24. I am so glad to have found this gem of a channel
    8
  25. Just a little comment for the algorithm, great work !
    7
  26. One of my favorite algorithms! Jack Edmonds once told the story of how he invented it. He had a conference talk scheduled but no results to present. While scrambling late into the night before the talk, he had the idea of the blossom ("Heureka, you shrink!") and worked out the whole algorithm.
    6
  27. T++ for the win!
    5
  28. I could watch this algorithm for hours... why must the video end?
    5
  29. Wow, this is awesome. The knapsack problem almost feels like it could be posed in discreet probability theory: given a random variable X, find a finite subset A of X that will maximize E[A] (=sum of p_i•x_i) and the sum of the chosen values x_i do not exceed a number k. Thanks for your website!
    5
  30. I love graph theory ! This algorithm animation gives me the shivers. I hope you'll upload another video like this !
    5
  31. Great work as usual boss
    4
  32. thanks for your videos, they are excellent
    4
  33. I've just discovered your channel and when I finished the video I thought you would have more subscribers. The quality is mind-blowing, keep going !
    4
  34. We should teach this in our elementary school math class! Your video makes it sound that easy. I implemented this algorithm before, and it took me two weeks. Pure respect for making it very easy to understand!
    4
  35. Nice! Thank you for making this video, and lots of luck having a bigger audience! (I'm the 26th subscriber :)
    3
  36. Great video!
    3
  37. If you breathed for like 5 seconds at the start to leave me enough time to turn the volume up without missing half the premise of the full video it would be great :)))
    3
  38. Great video. Does much better job (to explain the algorithm / proof) than any 30 min / one hour video on Vizing's theorem. Some details are kinda "left to check for the student" but the proof is all there.
    3
  39. Wow, this is definitely a highly underrated channel. Incredible video!
    3
  40. That's Awesome....and I know it takes a lot time to edit the video
    3
  41. Beautifully done!
    3
  42. Yes, another underrated youtube channel. We love those youtube :)
    2
  43. Perfect
    2
  44. Hi Tomas, Please see if u wud like to consider this suggestion. The animations are gr8 but too fast. Since I've to listen to u, understand the concept, as well as follow the animation... I'm getting confused if it's animating quickly I feel u cud slow down the animation speed a little more... ...and also add an arrow to indicate the direction of flow along the edges, apart from the flow of colors The audience can avoid multiple pauses and playbacks then, I think so :)
    2
  45. I love this, thanks so much for sharing
    2
  46. This is a beautiful video.
    2
  47. Hi Tom, this an offbeat request could you maybe review your CS Master's journey in Heidelberg University, with an international student POV if feasible. Thanks a lot for your videos, they truly are such a treat for an otherwise convoluted subject.
    2
  48. I JUST had an exam in mathematics in the modern world and Im kicking myself rn bc i didnt find this video a few hours ago
    2
  49. This is really cool! Applying pathing algorithms to state space is something I haven't dived deeply into before! It seems really cool!
    2
  50. Fantastic content quality
    2