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

被引：16
|
作者：
Huang, SM [1 ]
Liu, ZH
机构：
[1] Acad Sinica, Inst Policy & Management, Beijing 100080, Peoples R China
[2] Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1999年 / 112卷 / 02期
关键词：
linear programming; inverse problem; bipartite graph; strongly polynomial algorithm;
D O I：
10.1016/S0377-2217(97)00444-X
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
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.
引用
收藏
页码：421 / 426
页数：6
相关论文
共 50 条
12345