This note considers the feasibility for two types of multicommodity flow problems: maximal flow problems with both upper and lower arc capacities, and capacitated minimal cost trans-shipment problems.

Network slowdowns could soon be a thing of the past, thanks to a superfast new algorithm. The breakthrough offers a dramatically faster solution to a problem that has been plaguing computer scientists ...