Hierarchical solution of network flow pr
β
Anant H. V. Lyer; John J. Jarvis; H. Donald Ratliff
π
Article
π
1990
π
John Wiley and Sons
π
English
β 954 KB
## Abstract Given a network flow problem and a partition of its nodes into disjoint sets, we provide an aggregationβdisaggregation procedure that reformulates the problem as the union of network flow subproblems. Each subproblem either involves nodes in a set and their induced arcs or involves node