Search Results
IEOR E6614 OPTIMIZATION II. 4.50 points.
Lect: 3.
Prerequisites: 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
|
Spring 2022: IEOR E6614
| |||||
| Course Number | Section/Call Number | Times/Location | Instructor | Points | Enrollment |
|---|---|---|---|---|---|
| IEOR 6614 | 001/13610 | M W 4:10pm - 5:25pm 829 Seeley W. Mudd Building |
Daniel Bienstock | 4.50 | 18/40 |