Mar 08, 2025  
USC Catalogue 2023-2024 
    
Catalog Navigation
  Catalogue Home
  About USC
  Administration
  Admission and Orientation
  Tuition and Fees
  Academic Calendar
  The Schools and Academic Units
  Programs, Minors and Certificates
  Programs by School
  Courses of Instruction
  Schedule of Classes
  Academic and University Policies
  Undergraduate Education
  Graduate and Professional Education
  The Graduate School
  About the Catalogue
  Past Catalogues (Online)
HELP
USC Catalogue 2023-2024 [ARCHIVED CATALOGUE]

Facebook this Page (opens a new window)
Tweet this Page (opens a new window)

ISE 632 Network Flows and Combinatorial Optimization

Units: 4
Terms Offered: Fa, Sp
Combinatorial optimization, particularly graph problems. Shortest paths, max flow, minimum cost flows, Spanning trees, matroids, submodular functions. Bipartite and general matchings, Polyhedral combinatorics, total unimodularity.
Prerequisite: ISE 536 
Instruction Mode: Lecture
Grading Option: Letter


Facebook this Page (opens a new window)
Tweet this Page (opens a new window)