An efficient algorithm for the bipartite matching problem (Q1069866)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3932822
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for the bipartite matching problem |
scientific article; zbMATH DE number 3932822 |
Statements
An efficient algorithm for the bipartite matching problem (English)
0 references
1986
0 references
The minimum cost bipartite matching problem is considered. An approach based on the solution of a sequence of shortest path sub-problems is proposed. The particular structure of the problem and the use of reduced costs make it possible to devise an efficient ''threshold'' algorithm to solve these sub-problems. The computational behaviour of the proposed procedure is analyzed.
0 references
minimum cost bipartite matching problem
0 references
shortest path sub-problems
0 references
''threshold'' algorithm
0 references
0.8310694098472595
0 references
0.8280261158943176
0 references
0.8253010511398315
0 references
