The Theory of Networks and Management Science. Part I

Salah E. Elmaghraby
Additional contact information
Salah E. Elmaghraby: North Carolina State University

Management Science, 1970, vol. 17, issue 1, 1-34

Abstract: An expository treatment of three network models most often encountered in Management Science applications: (i) The Shortest Path Problems, (ii) Flow Networks, and (iii) Activity Networks. In the first problem are discussed the shortest path between two specified nodes; the shortest distance matrix; as well as the special case of directed acyclic networks. In the second problem, a brief exposition of the "labeling procedure" leads into multiterminal networks and the general minimal cost circulation problem and a discussion of the "out-of-kilter" method. In the third problem, the "classical" models of CPM and PERT are reviewed, together with a discussion of generalized activity networks and the viewing of GERT as a signal flow graph of a semi-Markov process. Illustrations of the application of each model are also given. The first two models appear in the September issue; and the third model in the October issue of Management Science.

Date: 1970
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.17.1.1 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:17:y:1970:i:1:p:1-34

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().