Spring

IEORE6614 Optimization, II


Instructor: Clifford Stein


4.5 pts. Lect: 3. Refer to course syllabus. An introduction to combinatorial optimization, network flows and discrete algorithms. Shortest path problems, maximum flow problems. Matching problems, bipartite and cardinality nonbipartite. Introduction to discrete algorithms and complexity theory: NP-completeness and approximation algorithms.



500 W. 120th St., Mudd 315, New York, NY 10027    212-854-2942                 
©2014 Columbia University