On inverse problems of optimum perfect matching

DOI10.1023/A:1027305419461zbMath1053.90012OpenAlexW2290850377MaRDI QIDQ1417847

Zhenhong Liu, Zhang, Jianzhong

Publication date: 6 January 2004

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1027305419461

zbMATH Keywords

linear programmingperfect matchingstrongly polynomial algorithmellipsoid methodmaximum-weight matchingmaximum-mean alternating cycle

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items (4)

Partial inverse assignment problems under \(l_{1}\) norm ⋮ Weighted inverse maximum perfect matching problems under the Hamming distance ⋮ General restricted inverse assignment problems under \(l_1\) and \(l_{\infty}\) norms ⋮ Inverse optimization problems with multiple weight functions

This page was built for publication: On inverse problems of optimum perfect matching