Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

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
DOI: 10.2307/2582634
Stable URL: http://www.jstor.org/stable/2582634
Page Count: 6
  • More info
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
A Network-Flow Algorithm for Project Selection
Preview not available

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.

Page Thumbnails

  • Thumbnail: Page 
847
    847
  • Thumbnail: Page 
848
    848
  • Thumbnail: Page 
849
    849
  • Thumbnail: Page 
850
    850
  • Thumbnail: Page 
851
    851
  • Thumbnail: Page 
852
    852