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

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.

Jeff Edwards, Tulsa River Parks Authority executive director, said the problem became clear Labor Day weekend, when "we ...

Three weeks ago, January 2002 was the worst January in a decade in terms of equity fund flows. A few days later, January 2002 was a great, $20 billion month. Mutual fund data provider Lipper had ...