Maximum matching in a convex bipartite graph

Fred Glover

Naval Research Logistics Quarterly, 1967, vol. 14, issue 3, 313-316

Abstract: A special matching problem arising in industry is shown to be solvable by an algorithm of the form: match objects ai and bj if they satisfy a local optirnality criterion based on a ranking of currently unmatched objects. When no ai and bi remain that can be matched, the largest number of acceptable matches has been found.

Date: 1967
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
https://doi.org/10.1002/nav.3800140304

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:14:y:1967:i:3:p:313-316

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().