Strong LP duality in weighted infinite bipartite graphs

DOI10.1016/0012-365X(94)90367-0zbMath0808.05078MaRDI QIDQ1332441

Ron Aharoni, Vladimir Korman

Publication date: 29 August 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphsminimum coverLP dualitycomplementary slackness conditionslinear programming dualityfractional maximum weight matching

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

On packing and covering polyhedra in infinite dimensions

Cites Work

• LP duality in infinite hypergraphs
• Infinite matching theory
• König's Duality Theorem for Infinite Bipartite Graphs

This page was built for publication: Strong LP duality in weighted infinite bipartite graphs