My Courses
Login
Join for Free

Lecture

Lec-24 Traveling Salesman Problem(TSP)

Video Player is loading.

Current Time 0:00

/

Duration 0:00

Loaded: 0%

Progress: 0%

Stream Type LIVE

Remaining Time -0:00

1x

Chapters

descriptions off, selected

captions settings, opens captions settings dialog
captions off, selected

This is a modal window.

Beginning of dialog window. Escape will cancel and close the window.

TextColorTransparency

BackgroundColorTransparency

WindowColorTransparency

Font Size

Text Edge Style

Font Family

End of dialog window.

Home
Indian Institute of Technology Madras
Mechanical - Advanced Operations Research
Lec-24 Traveling Salesman Problem(TSP)

Course Lectures

Lec-1 Introduction and Linear Programming

Play
Lec-2 Revised Simplex Algorithm

Play
Lec-3 Simplex Method for Bounded Variables

Play
Lec-4 One Dimensional Cutting Stock Problem

Play
Lec-5 One Dimensional Cutting Stock Problem(Contd)

Play
Lec-6 Dantzig-Wolfe Decomposition Algorithm

Play
Lec-7 Dantzig-Wolfe Decomposition Algorithm Primal-Dual Algorithm

Play
Lec-8 Primal-Dual Algorithm

Play
Lec-9 Goal Programming-Formulations

Play
Lec-10 Goal Programming Solutions Complexity of Simplex Algorithm

Play
Lec-11 Complexity of Simplex Algorithm(Contd) Integer Programming

Play
Lec-12 Integer Programming-Formulations

Play
Lec-13 Solving Zero-One Problems

Play
Lec-14 Solving Zero-One Problems(Contd)

Play
Lec-15 Branch And Bond Algorithm For Integer Programming

Play
Lec-16 Cutting Plane Algorithm

Play
Lec-17 All Integer Primal Algorithm

Play
Lec-18 All Integer Dual Algorithm

Play
Lec-19 Network Models

Play
Lec-20 Shortest Path Problem

Play
Lec-21 Successive Shortest Path Problem

Play
Lec-22 Maximum Flow Problem

Play
Lec-23 Minimum Cost Flow Problem

Play
Lec-24 Traveling Salesman Problem(TSP)

Playing
Lec-25 Branch and Bound Algorithms for TSP

Play
Lec-26 Heuristics for TSP

Play
Lec-27 Heuristics for TSP(Contd)

Play
Lec-28 Chinese Postman Problem

Play
Lec-29 Vehicle Routeing Problem

Play
Lec-30 Queueing Models

Play
Lec-31 Single Server Queueing Models

Play
Lec-32 Multiple Server Queueing Models

Play
Lec-33 Game Theory

Play
Lec-34 Critical Path Method

Play
Lec-35 Quadratic Programming

Play
Lec 36 - Integer Programming(continued)

Play
Lec 37 - All Integer Dual Algorithm

Play
Lec 38 - Mixed Integer Linear Programming

Play
Lec 39 - Benders Partitioning Algorithm

Play

About | Terms | Privacy | Contact Us | Schools facebook twitter

© 2009-2025 Courses.com. All rights reserved.