Lectures in course MATH-261: Discrete optimization

Covers Dijkstra's algorithm and its application to the all-pairs shortest path problem.

Explores the concept of duality in linear programming, discussing the relationship between primal and dual problems.

Covers the fundamentals of integer programming and network flows in directed graphs.

Linear Programming: Optimization and Constraints

Explores linear programming optimization with constraints, Dijkstra's algorithm, and LP formulations for finding feasible solutions.

Network Flow Algorithms

Covers network flow algorithms, including Max Flow, Min Cut, and Negative Cost Cycle Algorithm, progressing from basic definitions to advanced algorithms like Bellman-Ford and Dijkstra's.