Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

An Out-of-Kilter network tutorial

An Out-of-Kilter network tutorial Network flow algorithms have been developed to handle a special class of linear programming problems. These problems may each be described by a network whose links carry flow. Network algorithms take advantage of this special structure to produce an optimal solution much more quickly, with less storage required, and with virtually no round off error in comparison with general linear programming codes. The objective of this paper is to introduce the reader to the basic ideas involved in formulating a network problem, and to explain in a non-technical manner what the "out-of-kilter" network algorithm (1) does . This algorithm is very general and extremely efficient in solving network flow cost problems (as opposed to CPM, PERT, and GERT type networks). http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGMAP Bulletin Association for Computing Machinery

An Out-of-Kilter network tutorial

Swanson, H. S.; Woolsey, R. E. D.
ACM SIGMAP Bulletin , Volume (13) – Jan 1, 1973
Download PDF
7 pages

Loading next page...
 
/lp/association-for-computing-machinery/an-out-of-kilter-network-tutorial-4400U0EOPS

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1973 by ACM Inc.
ISSN
0163-5786
DOI
10.1145/1216978.1216980
Publisher site
See Article on Publisher Site

Abstract

Network flow algorithms have been developed to handle a special class of linear programming problems. These problems may each be described by a network whose links carry flow. Network algorithms take advantage of this special structure to produce an optimal solution much more quickly, with less storage required, and with virtually no round off error in comparison with general linear programming codes. The objective of this paper is to introduce the reader to the basic ideas involved in formulating a network problem, and to explain in a non-technical manner what the "out-of-kilter" network algorithm (1) does . This algorithm is very general and extremely efficient in solving network flow cost problems (as opposed to CPM, PERT, and GERT type networks).

Journal

ACM SIGMAP Bulletin – Association for Computing Machinery

Published: Jan 1, 1973

There are no references for this article.