Skip to content

Lec-26 Heuristics for TSP

nptelhrd2.25M subscribers

About this video

Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video

This 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.

Part of Mechanical - Advanced Operations Research