RUS  ENG
Full version
JOURNALS // Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica // Archive

Bul. Acad. Ştiinţe Repub. Mold. Mat., 2006 Number 1, Pages 51–56 (Mi basm84)

This article is cited in 1 paper

Research articles

On determining the minimum cost flows in dynamic networks

Maria Fonoberova

Institute of Mathematics and Computer Science, Academy of Sciences of Moldova, Chisinau, Moldova

Abstract: The dynamic minimum cost flow problem that generalizes the static one is studied. We assume that the supply and demand function and capacities of edges depend on time. One very important case of the minimum cost flow problem with nonlinear cost functions, defined on edges, that do not depend on flow but depend on time is studied.

Keywords and phrases: Dynamic networks, dynamic flows, minimum cost flows.

MSC: 90B10, 90C35, 90C27

Received: 18.01.2006

Language: English



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026