Sensitivity analysis of optimal matchings

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1981 English Publisher:WileyJournal:Networks, volume 11, pages 41-56 (issn: 0028-3045, eissn: 1097-0037,

Copyright policy )

Authors: G. M. Weber;

doi: 10.1002/net.3230110105

Sensitivity analysis of optimal matchings

- Summary
- Subjects
- Metrics

Abstract

AbstractAfter stating the weighted, perfect matching problem and briefly describing Edmonds' algorithm, certain postoptimality procedures are described. These procedures aid in reoptimizing related matching problems in which a few edge weights are altered. Regardless of the actual implementation of the matching algorithm used, when changing a single edge weight, the postoptimality procedures are on the order of cardinality (N) more efficient than solving the modified problem “from scratch,” where N is the node set of the underlying graph.

Related Organizations

Christopher Newport University
United States

Keywords

sensitivity analysis, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Integer programming, weighted perfect matching

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	27
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average