Discrete Optimization   [Archived Catalog]
2017-2018 Graduate Studies Bulletin (Archived Copy)
   
Print-Friendly Page (opens a new window)

MATH 770 - Discrete Optimization

Credits: 3

The application and analysis of algorithms for linear programming problems, including the simplex algorithm, algorithms and complexity, network flows, and shortest path algorithms. No computer programming experience required.



Print-Friendly Page (opens a new window)
Close Window
   
All bulletins © 2025 Columbia Campus.
Powered by the Acalog™ Academic Catalog Management System™ (ACMS™).

Mobile Site.