Because the payload that an airplane can carry is a function of the longest segment of its route and differs from route to route, the usual algorithms of network flow theory will not yield the optimum flow of payload. In this paper two network algorithms are described. They determine the route of maximum payload flow per hour of flight time and the maximum steady-state payload flow through a network with capacity constraints on the nodes.

Original document

The different versions of the original document can be found in:


DOIS: 10.1287/opre.12.2.230 10.21236/ad0412839

Back to Top

Document information

Published on 01/01/1963

Volume 1963, 1963
DOI: 10.1287/opre.12.2.230
Licence: Other

Document Score


Views 0
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?