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

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

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

https://doi.org/10.2307/3010426 • https://www.jstor.org/stable/3010426 Copy URL In this paper we study a minimum cost, multicommodity network flow problem in which ...