RUS  ENG
Полная версия
ЖУРНАЛЫ // Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica // Архив

Bul. Acad. Ştiinţe Repub. Mold. Mat., 2006, номер 1, страницы 51–56 (Mi basm84)

Эта публикация цитируется в 1 статье

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

Аннотация: 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.

Ключевые слова и фразы: Dynamic networks, dynamic flows, minimum cost flows.

MSC: 90B10, 90C35, 90C27

Поступила в редакцию: 18.01.2006

Язык публикации: английский



Реферативные базы данных:


© МИАН, 2024