ABSTRACT
This chapter presents four problems that are among the most frequently used in network analysis: the shortest route problem, the minimal spanning-tree problem, the maximal flow problem, and critical path method/program evaluation and review technique for planning and control. Network analysis also provides an excellent tool for establishing the work sequence well in advance of the actual undertaking of a project; thereby, allowing the decision makers the opportunity to monitor progress and correct potential problem areas. Network analysis has its origins in the more general theory of the graphs. A graph is an interconnected network of the elements consisting of the nodes called vertices and branches called edges or lines. Two network models that have received more attention than any other model in the literature on the network analysis are the critical path method and the program evaluation and review technique.
