OR 7245 — Network Analysis and Advanced Optimization
4 semester hoursGraduateLectureusually offered: springtypical days: TBostonOnlineTraditionalVideo Streaming
Considers concepts of advanced linear programming and network flows. Includes theory of the simplex method, the revised simplex algorithm using LU factorization, and simplex for bounded variables and primal-dual methods; methods for solving large-scale models such as Danzig-Wolfe decomposition, Bender’s partitioning, Lagrangian relaxation, and subgradient optimization; computational complexity and Karmarkar’s algorithm; minimum cost network flows, network simplex, and generalized and multicommodity network flow problems; and special types of network problems including the traveling salesman, routing, network location, and reliability problems.
Prerequisites
- OR 6205 (min C)
Offering history
| Term | Sections | Enrolled | Capacity | Full | Open seats/section |
|---|---|---|---|---|---|
| Spring 2024 | 1 | 6 | 25 | 24% | 19.0 |
| Spring 2025 | 1 | 6 | 25 | 24% | 19.0 |
| Spring 2026 | 2 | 7 | 32 | 22% | 12.5 |
Snapshots from scheduled scrapes — not live seat availability. "Full" can exceed 100% when sections over-enroll.
Meeting times
Share of recent sections by weekday: M 0% · T 95% · W 0% · Th 0% · F 0%
Common patterns: T (95% of sections), async (5% of sections) — in patterns, R means Thursday
Professors
Spring
- Ozlem Ergun (63% of students) · reviews
- Hande Musdal Ondemir (37% of students) · reviews
Percentages are each professor's average share of the season's enrolled students in recent terms.
Links
Official catalog (OR course descriptions) · Student reviews on RateMyHusky · All OR courses · Plan it at numap.app