A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...

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

The minimum cost flow problem is to determine a least cost shipment of a commodity through a network G = (N, A) in order to satisfy demands at certain nodes from available supplies at other nodes. In ...

A group of computer gamers are making habit of outshining scientists at their own game. Most of them have no scientific background, but they have a track record of cracking tough scientific puzzles, ...

Have a good mind for computational problem-solving? Fancy netting a cool $1 million for your efforts? Then the University of St. Andrews and the Clay Mathematics Institute sure have the competition ...

Research teams from energy giant ExxonMobil and IBM have been working together to find quantum solutions to one of the most complex problems of our time: managing the tens of thousands of merchant ...