摘要
提出了最短时限运输问题,借助于赋权二分图研究了其解的最优性充要条件,并给出了在赋权二分图上求解的具体步骤,最后给出了一个实例。事实证明。
Transportation prblem to the shortest time limit is put forward. The necessary and sufficient condition of its optimal solution is studied with the aid of bipartite graph with weight.The concrete solving steps are given at last.The algorithm in this paper is demonstrated to be a good alone.
出处
《运筹与管理》
CSCD
1999年第4期31-36,共6页
Operations Research and Management Science
关键词
运输问题
最短时限
赋权二分图
支撑树
transportation problem
the shortest time limit
bipartite graph with weight
supporting rtee
