Skip to content

Lec-25 Branch and Bound Algorithms 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 branch and bound algorithms for solving the traveling salesman problem, a key exact solution method. The content is part of the NPTEL course's structured coverage of optimization algorithms.

Video by nptelhrd, played through YouTube's embedded player.

Part of Mechanical - Advanced Operations Research