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

CSpace

	On the inverse problem of linear programming and its application to minimum weight perfect k-matching
	Huang, SM ; Liu, ZH
	1999-01-16
发表期刊	EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
ISSN	0377-2217
卷号	112 期号:2 页码:421-426
摘要	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.
关键词	linear programming inverse problem bipartite graph strongly polynomial algorithm
语种	英语
WOS研究方向	Business & Economics ; Operations Research & Management Science
WOS类目	Management ; Operations Research & Management Science
WOS记录号	WOS:000077283300014
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/14901
专题	中国科学院数学与系统科学研究院
通讯作者	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.