IE 516 Combinatorial Optimization
Credit Information:
(3+0+0) 3
Description:
Introduction to combinatorial optimization; shortest path problems; minimum spanning tree problem; maximum cardinality and weight matching problems in bipartite graphs; Hungarian algorithm; maximum cardinality and weight matching problems in general graphs; Edmond's algorithm; integral polyhedra; matroids; greedy algorithm.
Prerequisite:
IE 501 or equivalent.
Syllabus:
