Online Course Catalog

IE 519 B - Combinatorial Optimization

Spring 2027

Title	Section	CRN	Type	Hours	Times	Days	Location	Instructor
Combinatorial Optimization	B	79133	ONL	4	-			Karthekeyan Chandrasekaran

Course Description

The course will cover a series of topics in combinatorial optimization. The emphasis will be on polyhedral theory, structural results and their applications to designing algorithms. Specific topics to be covered include: Matchings, b-matchings, T-joins, T-cuts, Arborescences, Branchings, Matroids, Matroid Intersection, Polymatroids, Submodular Functions, Directed Cuts, Multi-flows.

Credit Hours

4 hours

Prerequisites

Undergraduate degree and familiarity with linear programs (IE 411 or equivalent), Algorithms (CS 374 or equivalent), and Graph Theory (Math 412 or equivalent).

Subject Area

Industrial and Enterprise Systems Engineering