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

The only known strongly polynomial algorithm for solving minimum cost submodular flow problems is due to Frank and Tardos [1985] and is based on the simultaneous approximation algorithm of Lenstra, ...

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.