6533b7d7fe1ef96bd1267884
RESEARCH PRODUCT
The minimal cost maximum matching of a graph (supplementary remarks)
Heiner Müller-merbachsubject
Linear bottleneck assignment problemMathematical optimizationProperty (philosophy)Matching (graph theory)General Mathematics3-dimensional matchingGraph (abstract data type)Management Science and Operations ResearchAssignment problemSoftwareGeneralized assignment problemWeapon target assignment problemMathematicsdescription
In addition to the preceding paper, it will be shown that (1) the matching problem is closely related to the linear assignment problem and how (2) this property can be taken advantage of for solving the matching problem.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1971-12-01 | Unternehmensforschung Operations Research - Recherche Opérationnelle |