Graphs, networks, min flow-max cut theorem and 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.