You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
A Network-Flow Algorithm for Project Selection
Barrie M. Baker
The Journal of the Operational Research Society
Vol. 35, No. 9 (Sep., 1984), pp. 847-852
Stable URL: http://www.jstor.org/stable/2582634
Page Count: 6
Preview not available
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.
The Journal of the Operational Research Society © 1984 Operational Research Society