Skip to main content

Combinatorics & Networks

applications; transportation problems, shortest route algorithms, critical path analysis, multi-commodity networks, covering and packing problems; integer programming, branch-and-bounding techniques, cutting plane algorithms, computational complexity.

Prefix:
OR
Course Number:
618
Credits:
3.0