MA 639 Discrete Optimization

The course discusses techniques from combinatorics, linear programming, and theory of algorithms to solve optimization problems over discrete structures. It covers well-known discrete optimization problems such as shortest path problem, certain flow problems, optimal matchings, traveling salesman problem, knapsack problem, and other discrete optimization problems; and theoretical considerations such as NP-completeness and Cook–Levin theorem.

Credits

3

Prerequisite

MA 502

Distribution

School of Engineering and Science

Typically Offered Periods

Fall Semester Spring Semester Summer Semester