KMS Of Academy of mathematics and systems sciences, CAS
On the inverse problem of linear programming and its application to minimum weight perfect k-matching | |
Huang, SM; Liu, ZH | |
1999-01-16 | |
Source Publication | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
![]() |
ISSN | 0377-2217 |
Volume | 112Issue:2Pages:421-426 |
Abstract | 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. |
Keyword | linear programming inverse problem bipartite graph strongly polynomial algorithm |
Language | 英语 |
WOS Research Area | Business & Economics ; Operations Research & Management Science |
WOS Subject | Management ; Operations Research & Management Science |
WOS ID | WOS:000077283300014 |
Publisher | ELSEVIER SCIENCE BV |
Citation statistics | |
Document Type | 期刊论文 |
Identifier | http://ir.amss.ac.cn/handle/2S8OKBNM/14901 |
Collection | 中国科学院数学与系统科学研究院 |
Affiliation | 1.Acad Sinica, Inst Policy & Management, Beijing 100080, Peoples R China 2.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China |
Recommended Citation 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. |
Files in This Item: | There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment