摘要
在考虑队列长度的前提下 ,论文在分析多源单汇资源传输问题的基础上 ,以两源单汇网络为例 ,在资源到达终点所需时间最短约束下 ,研究、计算了最短传输时间的上下界 ,并提出了相应的算法 .论文的研究内容为进一步研究多源多汇问题建立了基础 ,提供了思路 .
The problem that material is transported from sources to a destination in a network is analyzed, in which the length of the material queue is considered. Under the restriction of the shortest time, a approximate algorithm is brought forward in a network with two sources and a destination. By it, the bounds of transportation time are computed. The achievements in the paper are the base to make progress.
出处
《数学的实践与认识》
CSCD
北大核心
2005年第3期89-98,共10页
Mathematics in Practice and Theory
关键词
多源多汇网络
路径优化
路径更新原则
时间约束
图论
a network with sources and a destination
paths optimization
the rules to update paths
