Strong LP duality in weighted infinite bipartite graphs
type: Item
instance of: scholarly article
title: Strong LP duality in weighted infinite bipartite graphs
zbMATH Open document ID: 0808.05078
DOI: 10.1016/0012-365X(94)90367-0
author: Ron Aharoni
author: Vladimir Korman
published in: Discrete Mathematics
publication date: 1994-08-29T00:00:00Z
review text: 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.
reviewed by: Ján Plesník
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 626359
zbMATH Keywords: linear programming duality
zbMATH Keywords: LP duality
zbMATH Keywords: fractional maximum weight matching
zbMATH Keywords: minimum cover
zbMATH Keywords: bipartite graphs
zbMATH Keywords: complementary slackness conditions
MaRDI profile type: Publication
cites work: König's Duality Theorem for Infinite Bipartite Graphs
cites work: Infinite matching theory
cites work: LP duality in infinite hypergraphs
description: scientific article; zbMATH DE number 626359