MATH 5017

Combinatorial Optimization

New Mexico Institute of Mining and Technology · UGRD · Fall 2026

1 section

Catalog description

Maximum flow, shortest path, and minimum cost flow problems on networks. Matching. Matroids. Cutting plane and branch and bound methods for integer programming. Computational complexity of combinatorial optimization problems.

Sections

Current meeting, instructor, credit, and enrollment details

Updated 8 hours ago

001

Availability not recently verified

Class #new_mexico_mining_and-MATH5017Fall 2026UGRD3 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?