| Call Number | 11643 |
|---|---|
| Day & Time Location |
MW 10:10am-11:25am 829 Seeley W. Mudd Building |
| Points | 4.5 |
| Grading Mode | Standard |
| Approvals Required | None |
| Instructor | Eric Balkanski |
| Type | LECTURE |
| Method of Instruction | In-Person |
| Course Description | 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. |
| Web Site | Vergil |
| Department | Industrial Engineering and Operations Research |
| Enrollment | 22 students (40 max) as of 1:06PM Friday, April 19, 2024 |
| Subject | Industrial Engineering and Operations Research |
| Number | E6614 |
| Section | 001 |
| Division | School of Engineering and Applied Science: Graduate |
| Open To | Engineering:Graduate, GSAS |
| Campus | Morningside |
| Section key | 20231IEOR6614E001 |