This course covers computational approaches to discrete optimization problems. Topics include graph algorithms (shortest paths, MST, arborescences), matroid theory, Steiner tree problems, computational complexity (P, NP, NP-completeness), and approximation algorithm design using primal-dual methods.