Many important problems can be modeled as dynamic (time-expanded) network flow problems. For example, in building evacuation we might use twenty nodes to represent a room at 3 minute intervals over an ...

In a breakthrough that brings to mind Lucky Luke—the man who shoots faster than his shadow—Rasmus Kyng and his team have developed a superfast algorithm that looks set to transform an entire field of ...

A team of researchers led by Rasmus Kinn of the Swiss Federal Institute of Technology in Zurich has created a near-perfect algorithm to calculate the maximum transport flows at the lowest cost in any ...

The objective of this paper is the construction of a branch-and-bound algorithm for computing minimum cost flows in capacitated networks when the cost of passing a flow over an arc is concave. The ...

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