摘要
讨论了现代物流研究中单个配送中心的选址问题,该问题是一类需求点赋权的网络选址模型,针对于该模型,我们描述了更加切合实际的赋权中心问题和赋权重心问题.对这两类问题,用最小距离矩阵,给出了算法,并证明了这两个算法的复杂性是多项式的.
We give a model of location with weighted vertices in this paper,According to the model,we put forward the concept of weighted center and weighted median.The algorithms of solving them are given by using the least distance matrix.It has been proved the complexities of these two algorithms are polynomial.
出处
《沈阳师范大学学报（自然科学版）》
CAS
2005年第2期120-122,共3页
Journal of Shenyang Normal University:Natural Science Edition
基金
辽宁省教育厅资助项目(202112020).
关键词
网络选址
赋权中心
赋权重心
算法复杂性
network location
weighted center
weighted media
complexity of algorithm
