no. all methods in the video are heuristics. cutting-plane methods are only good for exact results (for example the &quot;concorde&quot; (the fastest tsp-solver) use such methods, but even in the past (~1950) such methods were used).
But heuristics are for most problems much better (much faster). For example &quot;LKH&quot; (a programm with a k-opt-heuristic) can solve easily a tsp-problem with &gt;1000 nodes in some seconds (and finds the optimum). Concorde (as i wrote, the fastes exact solver) needs hours for such problems.