|
|||||
|
|
On the inverse problem of linear programming and its application to minimum weight perfect k-matching |
|
| Institution: | 1. Department of Neurological Sciences, University of Vermont College of Medicine, Burlington, Vermont, United States;2. Departments of Anatomy/Neurobiology and Pediatrics, University of California—Irvine, Irvine, California, United States;3. Mediterranean Institute of Neurobiology (INMED), U901, INSERM, Marseille, France;4. Department of Neurology, University College London, Institute of Child Health, United Kingdom |
| 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. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |