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.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Baker, B. A Network-Flow Algorithm for Project Selection. J Oper Res Soc 35, 847–852 (1984). https://doi.org/10.1057/jors.1984.167
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1984.167