| |
Dec 22, 2024
|
|
|
|
|
2016-2017 Graduate Catalog ARCHIVED CATALOG: CONTENT MAY NOT BE CURRENT. USE THE DROP DOWN ABOVE TO ACCESS THE CURRENT CATALOG.
|
CS 754 - Discrete Optimization
Credits 3
Network optimization problems, use of advanced data structures. Topics may vary and include maximum-flow algorithms, multiterminal maximum flows, minimum cost flows and circulations, matching algorithms, approximation algorithms, and applications. Hamiltonian circuits in dense graphs, disjoint paths, the postman problem, introduction to combinatorial geometry, and linear programming.
Prerequisites
|
|