An efficient algorithm for the bipartite matching problem (Q1069866): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The alternating basis algorithm for assignment problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3968762 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A shortest augmenting path method for solving minimal perfect matching problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Successive Shortest Path Algorithm for The Assignment Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving the Assignment Problem by Relaxation / rank | |||
Normal rank | |||
Latest revision as of 10:26, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for the bipartite matching problem |
scientific article |
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
