热门
On the inverse problem of linear programming and its application to minimum weight perfect k-matching
文献类型：期刊论文
| 作者 | Huang, SM; Liu, ZH |
| 刊名 | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
 |
| 出版日期 | 1999 |
| 卷号 | 112期号:2页码:6,421-426 |
| 关键词 | Linear Programming Inverse Problem Bipartite Graph Strongly Polynomial Algorithm |
| ISSN号 | 0377-2217 |
| 英文摘要 | We first introduce the inverse problem of linear programming. We then apply it to the inverse problem of minimum weight perfect k-matching of bipartite graphs. We show that there is a strongly polynomial algorithm for solving the problem. (C) 1999 Elsevier Science B.V. All rights reserved. |
| 学科主题 | Management ; Operations Research & Management Science |
| 语种 | 英语 |
| WOS记录号 | WOS:000077283300014 |
| 公开日期 | 2012-11-12 |
| 源URL | [http://ir.casipm.ac.cn/handle/190111/5395]  |
| 专题 | 科技战略咨询研究院_中国科学院科技政策与管理科学研究所(1985年6月-2015年12月) |
| 推荐引用方式 GB/T 7714 | Huang, SM,Liu, ZH. On the inverse problem of linear programming and its application to minimum weight perfect k-matching[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,1999,112(2):6,421-426. |
| APA | Huang, SM,&Liu, ZH.(1999).On the inverse problem of linear programming and its application to minimum weight perfect k-matching.EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,112(2),6,421-426. |
| MLA | Huang, SM,et al."On the inverse problem of linear programming and its application to minimum weight perfect k-matching".EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 112.2(1999):6,421-426. |
入库方式： OAI收割
来源：科技战略咨询研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。