| OPRE 455 |
CRN 8100, 15 Points (2009 2/3) |
| Prerequisites: |
OPRE 351 |
| Recommended Reading: |
N. Christofides, Graph Theory: An Algorithmic Approach, Academic Press; Larson and Odoni, Urban Operations Research, Prentice Hall. |
| Description: |
An introduction to graphs and networks. Selected topics from: shortest path algorithms; minimal spanning tree algorithms; arc covering methods; node covering methods; vehicle routing and bin packing methods; network flow problems; scheduling problems; and matching theory. Real life applications will be discussed.
|
|
|
