Complexity of partial inverse assignment problem and partial inverse cut problem
文献类型：期刊论文
| 作者 | Yang, XG |
| 刊名 | RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH
 |
| 出版日期 | 2001 |
| 卷号 | 35期号:1页码:117-126 |
| 关键词 | partial inverse assignment problem partial inverse minimum cut problem NP-hard |
| ISSN号 | 0399-0559 |
| 英文摘要 | 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. |
| 语种 | 英语 |
| WOS记录号 | WOS:000168984500007 |
| 出版者 | E D P SCIENCES |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/15940]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | 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. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。