Multi-terminal multipath flows: synthesis
Discrete Applied Mathematics
Integer version of the multipath flow network synthesis problem
Discrete Applied Mathematics
| Hi-index | 0.00 |
The network synthesis problem is to design an undirected network with a minimum total construction cost which non-simultaneously satisfies given flow requirements between pairs of nodes. This well-known problem was introduced by Gomory and Hu (1961) who formulated it as a very large linear program and solved it by a method similar to column generation. We provide an efficient algorithm for this problem when the underlying graph is a cycle.