Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport costs for ...
This is a preview. Log in through your library . Abstract The only known strongly polynomial algorithm for solving minimum cost submodular flow problems is due to Frank and Tardos [1985] and is based ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback