Subject:
Combinatorics & Optimization (CO)
Catalog number:
652
Unit weight:
0.50
Meet type:
LEC
Cross-listing(s):
N/A
Requisites:
N/A
Description:
Formulation of problems as integer linear programs. Solution by branch-and-bound and cutting plane algorithms. Introduction to the theory of valid inequalities and polyhedral combinatorics.
Topic titles:
N/A
Faculty:
Mathematics (MAT)
Academic level:
GRD
Course ID:
000248
