中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
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-01-16
卷号112期号:2页码: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.
WOS研究方向Business & Economics ; Operations Research & Management Science
语种英语
WOS记录号WOS:000077283300014
出版者ELSEVIER SCIENCE BV
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/14900]  
专题中国科学院数学与系统科学研究院
通讯作者Huang, SM
作者单位1.Acad Sinica, Inst Policy & Management, Beijing 100080, Peoples R China
2.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式
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):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),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):421-426.

入库方式: OAI收割

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

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

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