IE 514 Network Flows
|
|
Flow problems on networks. Transportation and assignment problems, special purpose algorithms and advanced computational techniques. Maximum flow problem, theory, algorithms, and applications. Shortest paths. Minimum cost flows. Network simplex method. Multicommodity flow problems. Generalized networks.
Credit units: 3 ECTS Credit units: 5.
|
|
|
Bilkent University Main Page
Last regenerated automatically on April 25, 2024 by OAC - Online Academic Catalog Software
|
|
