On the inverse problem of linear programming and its application to minimum weight perfect k-matching

CASISD OpenIR > 中国科学院科技政策与管理科学研究所(1985年6月-2015年12月)

	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
关键词	Linear Programming Inverse Problem Bipartite Graph Strongly Polynomial Algorithm
摘要	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.
	1999
卷号	112 期号:2 页码:6,421-426
ISSN	0377-2217
学科领域	Management ; Operations Research & Management Science
收录类别	SCI
语种	英语
WOS记录号	WOS:000077283300014
引用统计	被引频次：14[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	http://ir.casisd.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.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
On the inverse probl（107KB）			开放获取	--	浏览