IEOR E6614

OPTIMIZATION II

Columbia University in the City of New York · UGRD · Fall 2026

1 section

Catalog description

Shortest path problems, maximum flow problems. Matching problems, bipartite and cardinality nonbipartite. Introduction to discrete algorithms and complexity theory: NP-completeness and approximation algorithms

Sections

Current meeting, instructor, credit, and enrollment details

Updated 13 hours ago

001

Availability not recently verified

Class #columbia_in_city_new_york-IEORE6614Fall 2026UGRD4.50 credits

Days & times: No scheduled meeting time
Meeting dates: —
Location: —
Instructor: Staff

Class numbers and section codes come from the registrar.

Spot missing or incorrect course data?