Lec-26 Heuristics for TSP
About this video
Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by videoThis lecture teaches heuristic methods for solving the traveling salesman problem, an NP-hard optimization challenge. It is part of a numbered NPTEL course sequence on operations research and algorithm design.
Video by nptelhrd, played through YouTube's embedded player.