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

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

Researchers have found a way to enhance hybrid flow batteries and their commercial use. The new approach can store electricity in these batteries for very long durations for about a fifth the price of ...

This is a preview. Log in through your library . Abstract This article reports small group experiments in which subjects may choose to contribute a fixed amount of money toward a monetary public good, ...