One-Pass Algorithms for Some Generalized Network Problems

A. Charnes and W. M. Raike
Additional contact information
A. Charnes: Northwestern University, Evanston, Illinois
W. M. Raike: Northwestern University, Evanston, Illinois

Operations Research, 1966, vol. 14, issue 5, 914-924

Abstract: The generalized network problem and the closely related restricted dyadic problem are two special model types that occur frequently in applications of linear programming. Although they are next in order after pure network or distribution problems with respect to ease of computation, the jump in degree of difficulty is such that, in the most general problem, there exist no algorithms for them comparable in speed or efficiency to those for pure network or distribution problems. There are, however, numerous examples in which some additional special structure leads one to anticipate the existence of algorithms that compare favorably with the efficiency of those for the corresponding pure cases. Also, these more special structures may be encountered as part of larger or more complicated models. In this paper we designate by topological properties two special structures that permit evolution of efficient algorithms. These follow by extensions of methods of Charnes and Cooper and of Dijkstra for the corresponding pure network problems. We obtain easily implemented algorithms that provide an optimum in one “pass” through the network. The proofs provided for these extended theorems differ in character from those provided (or not provided) in the more special “pure” problem algorithms published.

Date: 1966
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.14.5.914 (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:oropre:v:14:y:1966:i:5:p:914-924

Access Statistics for this article

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