Inverse matroid intersection problem
文献类型：期刊论文
| 作者 | Cai, MC; Li, YJ |
| 刊名 | MATHEMATICAL METHODS OF OPERATIONS RESEARCH
 |
| 出版日期 | 1997 |
| 卷号 | 45期号:2页码:235-243 |
| 关键词 | inverse matroid intersection problem minimum cost circulation strongly polynomial algorithm |
| ISSN号 | 1432-2994 |
| 英文摘要 | Let M-1 and M-2 be matroids on S, B be their k-element common independent set, and w a weight function on S. Given two functions b greater than or equal to 0 and c greater than or equal to 0 on S, the Inverse Matroid Intersection Problem (IMIP) is to determine a modified weight function w' such that (a) B becomes a maximum weight common independent set of cardinality k under w', (b) c\w' - w\ is minimum, and (c) \w' - w\ less than or equal to b. Many Inverse Combinatorial Optimization Problems can be considered as the special cases of the IMIP. In this paper we show that the IMIP can be solved in strongly polynomial time, and give a necessary and sufficient condition for the feasibility of the IMIP. Finally we extend the discussion to the version of the IMIP with Multiple Common Independent Sets. |
| WOS研究方向 | Operations Research & Management Science ; Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000071262600005 |
| 出版者 | PHYSICA VERLAG GMBH |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/13280]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Cai, MC |
| 作者单位 | Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Cai, MC,Li, YJ. Inverse matroid intersection problem[J]. MATHEMATICAL METHODS OF OPERATIONS RESEARCH,1997,45(2):235-243. |
| APA | Cai, MC,&Li, YJ.(1997).Inverse matroid intersection problem.MATHEMATICAL METHODS OF OPERATIONS RESEARCH,45(2),235-243. |
| MLA | Cai, MC,et al."Inverse matroid intersection problem".MATHEMATICAL METHODS OF OPERATIONS RESEARCH 45.2(1997):235-243. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。