Lecture 01 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
Introduction and Course Summary |
Lecture 02 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
Revision |
Lecture 03 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
Linear Programming |
Lecture 04 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
Algorithm Design in Matlab |
Lecture 05 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
The Simplex Algorithm |
Lecture 06 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
Simplex Phase II |
Lecture 07 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
The Simplex Algorithm (Phase I) |
Lecture 08 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
Algorithm analysis and Big-O notation |
Lecture 09 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
Duality and Complementary Slackness |
Lecture 10 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
Empirical Sensitivity Analysis |
Lecture 11 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
Integer Programming |
Lecture 12 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
Algorithm Analysis and Complexity |
Lecture 13 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
Complexity and the P vs NP problem |
Lecture 14 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
ILPs in Matlab and AMPL |
Lecture 15 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
The Greedy Heuristic |
Lecture 16 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
Graph Problems and Dijkstra's algorithm |
Lecture 17 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
Genetic Algorithms and Evolutionary Computing |
Lecture 18 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
Branch and Bound |
Lecture 19 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
Branch and Bound, part II |
Lecture 20 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
Primal Dual Algorithm, and Matrix Analysis of Simplex |
Lecture 21 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
Sensitivity Analysis |
Lecture 22 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
Linear Programming Revisited |
Lecture 23 |
![slides [PDF]](images/slides.jpg) |
|
![links](images/links.jpg) |
![outline](images/outline.jpg) |
Revision |