An efficient labeling technique for solving sparse assignment problems (Q1071650): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 360 / rank | |||
Normal rank | |||
Revision as of 10:10, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient labeling technique for solving sparse assignment problems |
scientific article |
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
