Mar 28, 2024  
2007-2008 Graduate Studies Bulletin 
    
2007-2008 Graduate Studies Bulletin [ARCHIVED BULLETIN]

Add to Personal Catalog (opens a new window)

CSC 205 - Combinatorial Optimization


Semester Hours: 3
Periodically
Brief overview of algorithm design and analysis; linear algebra; linear programming; the simplex algorithm; dynamic programming; greedy algorithms; amortized analysis; algorithms for matching; network flow; packing and scheduling; and branch and bound algorithms.

Prerequisites & Course Notes
CSC 204. (Formerly Algorithms II: Combinatorial Algorithms.)





Add to Personal Catalog (opens a new window)