Lectures related to Network Flows Meets Simplex

Covers the introduction to categories, including definitions and examples.

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Introduces the Simplex algorithm for solving flow problems and handling negative cost cycles.

Covers optimization problems in path finding and portfolio allocation.

Introduces the basics of graph algorithms, covering traversal, representation, and data structures for BFS and DFS.

Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.

Covers linear programming duality and complementary slackness condition.

Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.

Explains the SIMPLEX method for solving linear programs and optimizing the solution through basis variable manipulation.