Lectures related to Integer Programming and Network Flows

Explores coordination among agents in networked control systems through graph theory and real-world examples.

Explains the Bellman-Ford algorithm for finding the shortest path in a directed graph with edge weights.

Explores model selection challenges in causal models and the impact of local geometry on statistical inference.

Explores ecological vision and computational agent design in the context of visual perception and behavior.

Introduces the concept of categories essential for understanding group theory.

Covers the definition of a group, properties of symmetries, and group operations.

Introduces the Bellman-Ford algorithm for finding shortest paths in directed graphs with edge weights.

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