Show simple item record

dc.contributor.authorFu, Kezh_CN
dc.contributor.authorMiao, Zhaoweizh_CN
dc.contributor.authorXu, Jiayanzh_CN
dc.contributor.author缪朝炜zh_CN
dc.date.accessioned2015-07-22T03:08:07Z
dc.date.available2015-07-22T03:08:07Z
dc.date.issued2013zh_CN
dc.identifier.citationASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2013,30(2)zh_CN
dc.identifier.otherWOS:000317134700002zh_CN
dc.identifier.urihttps://dspace.xmu.edu.cn/handle/2288/87655
dc.descriptionNational Natural Science Foundation of China [71222105, 70701039, 70802052, 71072090]; Humanities and Social Science [09YJC630237]; National Ministry of Education; Fundamental Research Funds for the Central Universitieszh_CN
dc.description.abstractA medianoid problem is a competitive location problem that determines the locations of a number of new service facilities that are competing with existing facilities for service to customers. This paper studies the medianoid problem on the plane with Manhattan distance. For the medianoid problem with binary customer preferences, i.e., a case where customers choose the closest facility to satisfy their entire demand, we show that the general problem is NP-hard and present solution methods to solve various special cases in polynomial time. We also show that the problem with partially binary customer preferences can be solved with a similar approach we develop for the model with binary customer preferences.zh_CN
dc.language.isoen_USzh_CN
dc.publisherWORLD SCIENTIFIC PUBL CO PTE LTDzh_CN
dc.source.urihttp://dx.doi.org/10.1142/S0217595912500509zh_CN
dc.subjectFACILITY LOCATIONzh_CN
dc.subjectMAXIMUM CLIQUEzh_CN
dc.subjectDESIGNzh_CN
dc.subjectALGORITHMzh_CN
dc.subjectMODELSzh_CN
dc.subjectSINGLEzh_CN
dc.subjectSYSTEMzh_CN
dc.subjectGRAPHzh_CN
dc.titleON PLANAR MEDIANOID COMPETITIVE LOCATION PROBLEMS WITH MANHATTAN DISTANCEzh_CN
dc.typeArticlezh_CN


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record