Integer Optimization: Theory and Applications

Related lectures (25)

Page 1 of 3

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

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

Explores critical phenomena in complex systems, including stochastic objects, percolation, and combinatorial optimization.

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

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Explores the knapsack problem and the traveling salesman problem with a focus on optimization algorithms.

Explores the integrality gap concept in set cover and multiplicative weights algorithms.

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

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

Covers classical optimization problems, brute force algorithms, and integer linear optimization.