OPRE7313 - Network Flow

OPRE 7313 Network Flow (3 semester hours) Network flow models and solution algorithms. Matrix representations and properties, max-flow algorithms, min-cost flow algorithms, circulation and feasibility theorems, sensitivity analysis, integrality property of solutions, shortest route methods. Problems with special structure. CPT-PERT, multicommodity flows, matching, traveling salesperson problem. (3-0) T