|
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2005, номер 1, страницы 19–34
(Mi basm120)
|
|
|
|
Эта публикация цитируется в 1 научной статье (всего в 1 статье)
Optimal multicommodity flows in dynamic networks and algorithms for their finding
M. Fonoberova, D. Lozovanu Institute of Mathematics and Computer Science, Chişinău, Moldova
Аннотация:
In this paper we study two basic problems related to dynamic flows: maximum multicommodity flow
and the minimum cost multicommodity flow problems. We consider these problems on dynamic networks
with time-varying capacities of edges. For minimum cost multicommodity flow problem we assume that
cost functions, defined on edges, are nonlinear and depending on time and flow, and the demand
function also depends on time. We propose algorithms for solving these dynamic problems, which are
based on their reducing to static ones on a time-expanded network.
Ключевые слова и фразы:
Dynamic networks, dynamic flows, multicommodity flows, maximum flows, minimum cost flows.
Поступила в редакцию: 14.03.2005
Образец цитирования:
M. Fonoberova, D. Lozovanu, “Optimal multicommodity flows in dynamic networks and algorithms for their finding”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2005, no. 1, 19–34
Образцы ссылок на эту страницу:
https://www.mathnet.ru/rus/basm120 https://www.mathnet.ru/rus/basm/y2005/i1/p19
|
Статистика просмотров: |
Страница аннотации: | 400 | PDF полного текста: | 103 | Список литературы: | 46 | Первая страница: | 1 |
|