Optimization: Classical Problems

Covers optimization problems in path finding and portfolio allocation.

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

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.

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