IE 516 Birleşisel Eniyileme
Kredi Bilgisi:
(3+0+0) 3
Açıklama:
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.
Önkoşul:
IE 501 ya da eşdeğer.
Syllabus:
