Lectures related to Integer Program Formulation

Linear Programming: Optimization and Constraints

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

Convex Polyhedra and Linear Programs

Explores convex polyhedra, linear programs, and their optimization importance.

Dijkstra's Algorithm: All-Pairs

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

Linear Algebra: Efficiency and Complexity

Explores constraints, efficiency, and complexity in linear algebra, emphasizing convexity and worst-case complexity in algorithm analysis.

Reformulating Problems: Tools and Intuition

Focuses on open problems and the importance of reformulating problems with better tools and intuition.

Cutset Formulation: MST Problem

Explores the cutset formulation for the MST Problem and Gomory Cutting Planes method.

Optimization Algorithms

Covers optimization algorithms, convergence properties, and time complexity of sequences and functions.

Dynamic Programming: Integer Programming

Covers integer programming, dynamic programming, and optimal solutions complexity.

Transition to Smart Cities: Complexity and Interdependencies

Delves into the complexity and interdependencies of transitioning to smart cities, emphasizing the importance of a holistic approach.

Graph Coloring: Random vs Symmetrical

Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.

Computational Complexity

Covers the basics of computational complexity, including big O notation and complexity classes.

Solving Parity Games in Practice

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Linear Programming: Extreme Points

Explores extreme points in linear programming and the role of constraints in finding optimal solutions.

Algorithmic Complexity: Definition and Examples

Explores algorithm correctness, worst-case complexity analysis, and efficiency comparison based on input size.

Improved Algorithm: Three-Color Parity Games

Introduces an improved algorithm for three-color parity games, focusing on progress measures, acceleration, and practical speed-up.

Implementation Research: Concepts and Scope

Explores Implementation Research, addressing challenges in implementing health interventions and developing effective strategies for infectious diseases of poverty.

Computational Complexity: Theory and Applications

Explores computational complexity, NP-completeness, and polynomial reductions in theoretical computer science.

Linear Systems: Convergence and Methods

Explores linear systems, convergence, and solving methods with a focus on CPU time and memory requirements.

Untitled

Graph Coloring: Theory and Applications

Covers the theory and applications of graph coloring, focusing on disassortative stochastic block models and planted coloring.