This paper presents ration-by-distance (RBD), a new allocation method to be used in planning ground delay programs (GDPs) for Traffic Flow Management. It is shown that RBD minimizes total expected delay, under certain assumptions related to the manner in which GDP's are dynamically controlled....

We study a type of network flow problem that we call the minimum-cost F-graph flow problem. This problem generalizes the typical minimum-cost network flow problem by allowing the underlying network to be a directed hypergraph rather than a directed graph. This new problem is pertinent because it...