最短时限运输问题及图上求解法  

Transportation Problem to the Shortest Time Limit and Its Algorithm on Graph

作　　者：李珍萍[1] 

机构地区：[1]潍坊医学院数学教研室,山东潍坊261042

出　　处：《运筹与管理》1999年第4期31-36,共6页Operations Research and Management Science

摘　　要：提出了最短时限运输问题,借助于赋权二分图研究了其解的最优性充要条件,并给出了在赋权二分图上求解的具体步骤,最后给出了一个实例。事实证明。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.

关 键 词：运输问题 最短时限 赋权二分图 支撑树 

分 类 号：O221.1[理学—运筹学与控制论] O223[理学—数学]