IMCS/Publications/BASM/Issues/BASM n.3 (37), 2001/

The minimum-cost flow problem on dynamic networks and an algorithm for its solving.

Authors: Lozovanu Dmitrii, Stratila D.


We study the minimum-cost flow problem on acyclic dynamic networks with non-linear cost functions depending on time and edge flow. We present an algorithm for solving the problem on networks with unit transit time, and study its generalizations. We also discuss details concerning the correctness of the algorithm, and its computational complexity.