We propose a new class of algorithms for linear cost network flow problems with and without gains. These algorithms are based on iterative improvement of a dual cost and operate in a manner that is ...

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 ...

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 ...

Current chemotherapeutic regimens achieve CR in a large percentage of patients with AML. However, relapse after CR remains a significant problem. The presence of leukemic cells at levels too low to be ...

Of the nearly 250,000 oil and gas flow lines tested throughout Colorado since a massive home explosion in Firestone in April, many of Weld’s oil and gas operators are reporting few lines failed.