Subject: 
Combinatorics & Optimization (CO)
Catalog number: 
650
Unit weight: 
0.50
Meet type: 
LEC
Grading basis: 
NUM
Cross-listing(s): 
N/A
Requisites: 
N/A
Description: 
Characterizations of optimalsolutions and efficient algorithms for optimization problems over discrete structures. Topics include network flows, optimal matchings, T-joins and postman tours, matroid optimization.
Topic titles: 
N/A
Faculty: 
Mathematics (MAT)
Academic level: 
GRD
Course ID: 
000247