CEE 6630 - [Network Flows and Algorithms]

Spring. 3 credits.

Prerequisite: CEE 6620 or permission of instructor. Next Offered 2013-2014.

L. K. Nozick.

Algorithms for network flow problems encountered in transportation systems modeling, including shortest path, multiobjective shortest path, minimum cost flows, multi-commodity flows, and generalized flows. Applications to vehicle routing, dynamic vehicle allocation, and network design.