摘要
在考虑各个库存中心风险的基础上,如何来调拨各个库存中心的物资来满足一个商店的供货需求,同时使得最大调整时间最小,并保证库存中心缺货风险最小。通过分析任意点对之间字典序下最大权最小路径和最小生成树之间的关系,给出了解决上述问题的有效算法。
A problem of how to prepare the materials to meet the needs of stores and guarantee the max adjustment time is minimal and the risk out of stock is lowest when different stock risks are proposed.Through analyzing the relationship between lexicographical Minmax path and the minimum spanning tree of a given graph,the solvable algorithms is presented. Key wrods:the minimum spanning tree; the minmax path; the minmax adjustment time; risk out of stock
出处
《西北大学学报（自然科学版）》
CAS
CSCD
北大核心
2003年第2期241-244,共4页
Journal of Northwest University（Natural Science Edition）
基金
国家自然科学基金资助项目(7980004)
