An efficient labeling technique for solving sparse assignment problems (Q1071650)
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: An efficient labeling technique for solving sparse assignment problems |
scientific article; zbMATH DE number 3939092
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient labeling technique for solving sparse assignment problems |
scientific article; zbMATH DE number 3939092 |
Statements
An efficient labeling technique for solving sparse assignment problems (English)
0 references
1986
0 references
We describe a new implementation of the shortest augmenting path approach for solving sparse assignment problems and report computational experience documenting its efficiency.
0 references
implementation
0 references
shortest augmenting path
0 references
sparse assignment
0 references
computational experience
0 references
