Maximum Payloads Per Unit Time Delivered Through an Air Network
暂无分享,去创建一个
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.
[1] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[2] G. Dantzig. On the Shortest Route Through a Network , 1960 .
[3] D. R. Fulkerson,et al. A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem , 1957, Canadian Journal of Mathematics.