Relations Between Events

Related lectures (32)

Page 1 of 4

Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.

Covers linear programming duality and complementary slackness condition.

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

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

Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.

Introduces spanning trees in graphs and the Minimum Spanning Tree problem, exploring efficient algorithms for optimal decision-making.

Covers optimization problems in path finding and portfolio allocation.

Covers sensitivity analysis in linear programming, focusing on optimal solutions and their sensitivities to changes.

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

Covers the implementation and analysis of disjoint sets data structure and introduces the concept of minimum spanning trees.