Spring 2023
OPTIMIZATION II
, 4.5 pts, E6614OPTIMIZATION II
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.
- Section Number
- 001
- Call Number
- 11643
- Day, Time & Location
- MW 10:10AM-11:25AM 829 Seeley W. Mudd Building
- Instructor
- Eric Balkanski