[1]姜忠义,陈芳芳.网络选址的绝对重心问题和赋权绝对重心(p =1) 问题的一种新方法证明[J].常州大学学报(自然科学版),2009,(01):60-61.
　JIANG Zho ng -yi,CHEN Fang -fang.New Way to Prove the Absolute Median and Weighted Absolute Median Problem in the Network Location[J].Journal of Changzhou University(Natural Science Edition),2009,(01):60-61.
点击复制

网络选址的绝对重心问题和赋权绝对重心(p =1) 问题的一种新方法证明()
分享到：

常州大学学报(自然科学版)[ISSN:2095-0411/CN:32-1822/N]

卷:
期数:
2009年01期
页码:
60-61
栏目:
出版日期:
2009-03-25

文章信息/Info

Title:
New Way to Prove the Absolute Median and Weighted Absolute Median Problem in the Network Location
作者:
姜忠义;  陈芳芳
江苏工业学院数理学院, 江苏 常州 213164
Author(s):
JIANG Zho ng -yi ;  CHEN Fang -fang
Schoo l of Phy sics and Mathematics , Jiang su Poly technic Universi ty , Changzho u 213164 , China
关键词:
绝对重心问题; 赋权绝对重心; 反证法
Keywords:
absolute median ; weig hted abso lute median ; reductio n to absurdity
分类号:
O 22　
文献标志码:
A
摘要:
网络选址的绝对重心和赋权绝对重心问题是网络选址的两个经典的问题。以往的文献对于这两个问题的证明很复杂, 在 这里使用反证法, 重新给出了一个比较简单, 易懂的证明。通过证明, 可以更好的分析和理解这两个问题。
Abstract:
The absolute median and weighted absolute median pro blem are classical problems in the network lo cation problem .The proof of the tw o pro blems in the previous paper is very complex .In this paper we give a simple and easy -unde rstudied way to prove them .Through the proof , we can analyze and understand the tw o problems bet ter .

参考文献/References:

[1] H akimi S L.Opt imal locati on of sw it ching cent ers an d the absolu te cent ers and m edians of grap h [J] .Ops Res , 1964 (12):450 -459 .
[2] H akimi S L .Opt imum di st ribut ion of sw it ching cen ters in a comm unicati on netw ork and some relat ed graph theoret ic p roblem s [J] .Ops Res , 1965 (13):642 -475.
[3] Brandeau M L, Chiu S S .An overview of repres ent ati ve p roblem s in l ocat ion res earch [J] .M anagemen t Science , 1989 , 35 (6):645 -674 .
[4] Cu rrent J , Min H S chil ling D .Mult iobject ive analysi s of facility l ocat ion deci si ons [J] .Eur Journal Ops Res , 1990 (49): 295 -307 .

备注/Memo

备注/Memo:
作者简介:姜忠义(1977 -), 男, 山东海阳人, 硕士。
更新日期/Last Update: 2009-03-25