.png){kind=icon}
返回
Time-varying minimum cost flow problems
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(00)00059-X.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we study a minimum cost flow problem on a time-varying network. Let N(V, A, l, b, c(r), c(w)) be a network with an are set A and a vertex set V. Each a is an element of A is associated with three integer parameters: a positive transit time b(a, t), an arbitrary transit cost c(r)(a, t), and a positive capacity limit l(a, t). Each x is an element of V is associated with two integer parameters: a waiting cost c(w)(x, t) and a vertex capacity l(x, t). All these parameters are functions of the discrete time t = 0, 1, 2,... The objective is to find an optimal schedule to send a flow from the origin (the source vertex) to its destination (the sink vertex) with the minimum cost, subject to the constraint that the flow must arrive at the destination before a deadline T. Three versions of the problem are examined, which are classified depending on whether waiting at the intermediate vertices of the network is strictly prohibited, arbitrarily allowed, or bounded. Three algorithms with pseudopolynomial time complexity are proposed, which can find optimal solutions to the three versions of the problem, respectively. (C) 2001 Elsevier Science B.V. All rights reserved.
Keyword:
time-varying network
minimum cost flow
dynamic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
Do Nurse-Led Skill Training Interventions Affect Informal Caregivers' Out-of-Pocket Expenditures?
OAAI
OAAI分享收藏 没有更多内容
没有更多内容