A labeling algorithm to solve the assignment problem (Q1823140)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A labeling algorithm to solve the assignment problem |
scientific article; zbMATH DE number 4114375
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A labeling algorithm to solve the assignment problem |
scientific article; zbMATH DE number 4114375 |
Statements
A labeling algorithm to solve the assignment problem (English)
0 references
1989
0 references
This paper describes a simple labeling algorithm to solve the assignment problem. The labeling approach is based on the maximum-flow formulation of the problem of finding the fewest number of lines to cover all zeros in the reduced assignment matrix. The approach is useful for educational purposes as well as programming environments. The labeling procedure can be used without requiring familiarity with the maximum-flow problem.
0 references
Hungarian method
0 references
labeling algorithm
0 references
assignment
0 references
maximum-flow formulation
0 references
