Strong LP duality in weighted infinite bipartite graphs
The problems of fractional maximum weight matching and the corresponding minimum cover are considered for bipartite graphs. It is well known that for finite graphs and integer weights the max = min relation can be attained for integer solutions. Here the question is studied for infinite graphs via the complementary slackness conditions.
scientific article; zbMATH DE number 626359