中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Some reverse location problems

文献类型:期刊论文

作者Zhang, JZ; Liu, ZH; Ma, ZF
刊名EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
出版日期2000-07-01
卷号124期号:1页码:77-88
关键词facility location tree network minmax criterion minimum cut
ISSN号0377-2217
英文摘要The general location problem in a network is to find locations of facilities in a given network such that the total cost is minimum. It is very often to have its reverse case, in which the facilities have already been located on the network, and the problem is how to improve the network within a given budget so that the improved network is as efficient as possible. In this paper we present a strongly polynomial algorithm for a reverse location problem in tree networks. The method can be extended to solve reverse two- or more-location problems. (C) 2000 Elsevier Science B.V. All rights reserved.
WOS研究方向Business & Economics ; Operations Research & Management Science
语种英语
WOS记录号WOS:000087093400007
出版者ELSEVIER SCIENCE BV
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/14981]  
专题中国科学院数学与系统科学研究院
通讯作者Zhang, JZ
作者单位1.City Univ Hong Kong, Dept Math, Hong Kong, Hong Kong, Peoples R China
2.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Zhang, JZ,Liu, ZH,Ma, ZF. Some reverse location problems[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,2000,124(1):77-88.
APA Zhang, JZ,Liu, ZH,&Ma, ZF.(2000).Some reverse location problems.EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,124(1),77-88.
MLA Zhang, JZ,et al."Some reverse location problems".EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 124.1(2000):77-88.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。