Network Optimization

This is an incomplete collection of recordings of the lectures given by Dr. El-Beltagy in the Fall Semester of 2006/2007 at the Faculty of Computers and Information at Cairo University.

The lectures are given in a rather informal style, and delivered in mix of English and Arabic. It is unlikely to be of value for those not attending this course.

• Data Structures and Breadth First Search

• Search and Topological Ordering

• Flow Decomposition

• Introduction to the Shortest Path Algorithm

• Dijkstra's Algorithm

• Dail's Shortest Path Implementation

• Lot Sizing and Radix Heaps

• Radix Heap Complexity

• Introduction to Max-Flow (missing)

• Proof of the Ford-Fulkerson Algorithm

• Proof of the Ford-Fulkerson Algorithm and its Application in Scheduling

• Min Cost Flow