KMS Of Academy of mathematics and systems sciences, CAS
Complexity of partial inverse assignment problem and partial inverse cut problem | |
Yang, XG | |
2001 | |
发表期刊 | RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH |
ISSN | 0399-0559 |
卷号 | 35期号:1页码:117-126 |
摘要 | For a given partial solution, the partial inverse problem is to modify the coefficients such that there is a full solution containing the partial solution, while the full solution becomes optimal under new coefficients, and the total modification is minimum. In this paper, we show that the partial inverse assignment problem and the partial inverse minimum cut problem are NP-hard if there are bound constraints on the changes of coefficients. |
关键词 | partial inverse assignment problem partial inverse minimum cut problem NP-hard |
语种 | 英语 |
WOS研究方向 | Operations Research & Management Science |
WOS类目 | Operations Research & Management Science |
WOS记录号 | WOS:000168984500007 |
出版者 | E D P SCIENCES |
引用统计 | |
文献类型 | 期刊论文 |
条目标识符 | http://ir.amss.ac.cn/handle/2S8OKBNM/15941 |
专题 | 中国科学院数学与系统科学研究院 |
通讯作者 | Yang, XG |
作者单位 | Chinese Acad Sci, Inst Syst Sci, Lab Management Decis & Informat Syst, Beijing 100080, Peoples R China |
推荐引用方式 GB/T 7714 | Yang, XG. Complexity of partial inverse assignment problem and partial inverse cut problem[J]. RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH,2001,35(1):117-126. |
APA | Yang, XG.(2001).Complexity of partial inverse assignment problem and partial inverse cut problem.RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH,35(1),117-126. |
MLA | Yang, XG."Complexity of partial inverse assignment problem and partial inverse cut problem".RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH 35.1(2001):117-126. |
条目包含的文件 | 条目无相关文件。 |
个性服务 |
推荐该条目 |
保存到收藏夹 |
查看访问统计 |
导出为Endnote文件 |
谷歌学术 |
谷歌学术中相似的文章 |
[Yang, XG]的文章 |
百度学术 |
百度学术中相似的文章 |
[Yang, XG]的文章 |
必应学术 |
必应学术中相似的文章 |
[Yang, XG]的文章 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论