Sciweavers

NETWORKS
2006
13 years 3 months ago
The multiroute maximum flow problem revisited
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
Donglei Du, R. Chandrasekaran