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

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

0.00 Avg rating—0 Votes
Article ID: iaor20001803
Country: Netherlands
Volume: 112
Issue: 2
Start Page Number: 421
End Page Number: 426
Publication Date: Jan 1999
Journal: European Journal of Operational Research
Authors: ,
Keywords: matching
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.

Reviews

Required fields are marked *. Your email address will not be published.