everything.study
ORI 391Q.3

Network Flow Programming

3 Hours

Optimization problems related to network flows, shortest path, maximum flow, minimum cost flow, generalized networks, nonlinear costs. Modeling, theory, and computational methods.

Prerequisites & course information

Optimization problems related to network flows, shortest path, maximum flow, minimum cost flow, generalized networks, nonlinear costs. Modeling, theory, and computational methods.

Sources