Sensitivity analysis of the bipartite weighted matching problem

MaRDI QIDQ4494409zbMATH OpenFDO

Authors Hans Achatz

Publication date 18 February 2004

zbMATH Keywords

maximum weighted matchingsensitivity analysisshortest pathundirected bipartite graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Sensitivity, stability, parametric optimization (90C31) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 840699
• Optimum matchings in weighted bipartite graphs
• A note on the weighted matching with penalty problem
• Weighted Bipartite Matching in Matrix Multiplication Time

Cited in

(5)

• scientific article; zbMATH DE number 3900499 (Why is no real title available?)
• A note on the weighted matching with penalty problem
• Dual and simultaneous sensitivity analysis for matched pairs
• scientific article; zbMATH DE number 840699 (Why is no real title available?)
• Perturbation analysis of maximum-weighted bipartite matchings with low rank data

This page was built for publication: Sensitivity analysis of the bipartite weighted matching problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4494409)