Maximum Payloads Per Unit Time Delivered Through an Air Network


== Abstract ==

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:

* [http://dx.doi.org/10.21236/ad0412839 http://dx.doi.org/10.21236/ad0412839]

* [http://hdl.handle.net/2027/uc1.c101054629 http://hdl.handle.net/2027/uc1.c101054629] under the license pd

* [http://www.dtic.mil/dtic/tr/fulltext/u2/412839.pdf http://www.dtic.mil/dtic/tr/fulltext/u2/412839.pdf]

* [https://pubsonline.informs.org/doi/abs/10.1287/opre.12.2.230 https://pubsonline.informs.org/doi/abs/10.1287/opre.12.2.230],
: [https://dl.acm.org/citation.cfm?id=2783668 https://dl.acm.org/citation.cfm?id=2783668],
: [https://ideas.repec.org/a/inm/oropre/v12y1964i2p230-236.html https://ideas.repec.org/a/inm/oropre/v12y1964i2p230-236.html],
: [https://academic.microsoft.com/#/detail/2035569178 https://academic.microsoft.com/#/detail/2035569178]

* [https://pubsonline.informs.org/doi/pdf/10.1287/opre.12.2.230 https://pubsonline.informs.org/doi/pdf/10.1287/opre.12.2.230],
: [http://dx.doi.org/10.1287/opre.12.2.230 http://dx.doi.org/10.1287/opre.12.2.230]



DOIS: 10.1287/opre.12.2.230 10.21236/ad0412839