'Traveling Salesman Problem (TSP)' Video Lecture

Traveling Salesman Problem (TSP)

  • Course: Advanced Operations Research
  • Discipline: Mechanical Engineering
  • Faculty: Prof. G. Srinivasan
  • Institute: IIT Madras

    • NEXT LECTURE >> Branch and Bound Algorithms for TSP
    Download this video in MP4, FLV & 3GP formats
    Format  Size  Download
    MP4 270 MB MP4 Video Download Link 1
    MP4 270 MB MP4 Video Download Link 2
    FLV 175 MB FLV Video Download Link 1
    FLV 175 MB FLV Video Download Link 2
    3gp 62 MB 3gp Video Download Link 1
    3gp 62 MB 3gp Video Download Link 2
    Search Courses
    Course Video Lectures Introduction and Linear Programming Revised Simplex Algorithm Simplex Method for Bounded Variables One Dimensional Cutting Stock Problem One Dimensional Cutting Stock Problem (Contd) Dantzig-Wolfe Decomposition Algorithm Dantzig-Wolfe Decomposition Algorithm Primal-.. Primal-Dual Algorithm Goal Programming-Formulations Goal Programming Solutions Complexity of Simp.. Complexity of Simplex Algorithm (Contd) Integ.. Integer Programming-Formulations Solving Zero-One Problems Solving Zero-One Problems (Contd) Branch And Bond Algorithm For Integer Program.. Cutting Plane Algorithm All Integer Primal Algorithm All Integer Dual Algorithm Network Models Shortest Path Problem Successive Shortest Path Problem Maximum Flow Problem Minimum Cost Flow Problem Traveling Salesman Problem (TSP) Branch and Bound Algorithms for TSP Heuristics for TSP Heuristics for TSP (Contd) Chinese Postman Problem Vehicle Routeing Problem Queueing Models Single Server Queueing Models Multiple Server Queueing Models Game Theory Critical Path Method Quadratic Programming Integer Programming(continued) All Integer Dual Algorithm Mixed Integer Linear Programming Benders Partitioning Algorithm
    2015. EngineeringVideoLectures.com