A Network-Flow Algorithm for Project Selection

Abstract

A simple network-flow algorithm is described for solving a class of problems, with various applications, including that of project selection. The algorithm should have wide appeal since no prior knowledge of network algorithms is required, and the familiar activity-on-node type of network provides the starting point for the algorithm. This work is an extension of an approach recently proposed by H. P. Williams.

Keywords:

• network flow
• activity-on-node diagram