Maximum Payloads Per Unit Time Delivered Through an Air Network

George B. Dantzig and David L. Johnson
Additional contact information
George B. Dantzig: Operations Research Center University of California, Berkeley
David L. Johnson: Boeing Scientific Research Laboratories Seattle, Washington

Operations Research, 1964, vol. 12, issue 2, 230-236

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.

Date: 1964
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.12.2.230 (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:12:y:1964:i:2:p:230-236

Access Statistics for this article

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