Link to lecture

2-11-11 Lecture 1 : models

4-11-11 Lecture 2 : Integer Programming

9-11-11 Lecture 3 : Linear Programming -graphical resolution

11-11-11 Lecture 4 : Basic Feasible Solutions (1)

18-11-11 Lecture 5 : Basic Feasible Solutions (2)

23-11-11 Lecture 6 : Simplex Features

23-11-11 Lecture 6 : The Simplex Algebrically

25-11-11 Lecture 7 : The Simplex Algorithm - Examples

25-11-11 Lecture 7 : The two phases algorithm

7-12-11 Lecture 8 : Duality

9-12-11 Lecture 9 : The Transportation Problem

14-12-11 Lecture 10 : Vogel heuristic for the transportation problem

16-12-11 Lecture 11 : Unimodularity - Exercises

21-12-11 Lecture 12 : Explicite Enumeration

21-12-11 Lecture 12 : Branch And Bound

23-12-11 Lecture 13 : Branch And Bound (examples: the vertex cover)

23-12-11 Lecture 13 : The Hamiltonian path by B&B

11-01-12 Lecture 14 : Heristics Evaluation

13-01-12 Lecture 15 : Vertex Cover Approximation

18-01-12 Lecture 16 : Approximate Knapasack, Bin Packing, Steiner Tree

20-01-12 Lecture 17 : EXETASH ASKHSEON

25-01-12 Lecture 18 : EXETASH ASKHSEON

27-01-12 Lecture 19 : The Generalized Simplex

 

Current Lesson