中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
The complexity analysis of the inverse center location problem

文献类型:期刊论文

作者Cai, MC; Yang, XG; Zhang, JZ
刊名JOURNAL OF GLOBAL OPTIMIZATION
出版日期1999-09-01
卷号15期号:2页码:213-218
ISSN号0925-5001
关键词complexity location problem networks and graphs satisfiability problem
英文摘要Given a feasible solution, the inverse optimization problem is to modify some parameters of the original problem as little as possible, and sometimes also with bound restrictions on these adjustments, to make the feasible solution become an optimal solution under the new parameter values. So far it is unknown that for a problem which is solvable in polynomial time, whether its inverse problem is also solvable in polynomial time. In this note we answer this question by considering the inverse center location problem and show that even though the original problem is polynomially solvable, its inverse problem is NP-hard.
WOS研究方向Operations Research & Management Science ; Mathematics
语种英语
出版者KLUWER ACADEMIC PUBL
WOS记录号WOS:000082507500007
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/14534]  
专题中国科学院数学与系统科学研究院
通讯作者Cai, MC
作者单位1.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
2.City Univ Hong Kong, Dept Math, Hong Kong, Hong Kong
推荐引用方式
GB/T 7714
Cai, MC,Yang, XG,Zhang, JZ. The complexity analysis of the inverse center location problem[J]. JOURNAL OF GLOBAL OPTIMIZATION,1999,15(2):213-218.
APA Cai, MC,Yang, XG,&Zhang, JZ.(1999).The complexity analysis of the inverse center location problem.JOURNAL OF GLOBAL OPTIMIZATION,15(2),213-218.
MLA Cai, MC,et al."The complexity analysis of the inverse center location problem".JOURNAL OF GLOBAL OPTIMIZATION 15.2(1999):213-218.

入库方式: OAI收割

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

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

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