Alternate strategies for solving bottleneck assignment problems - analysis and computational results (Q798564): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q340252 |
||
| Property / author | |||
| Property / author: Ulrich Derigs / rank | |||
Revision as of 14:33, 13 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Alternate strategies for solving bottleneck assignment problems - analysis and computational results |
scientific article |
Statements
Alternate strategies for solving bottleneck assignment problems - analysis and computational results (English)
0 references
1984
0 references
We analyze two strategies for solving the bottleneck assignment problem - the threshold method and the shortest augmenting path concept -, show their theoretical equivalence and computational behaviour. We develop a new rather efficient labeling technique to be used in the shortest augmenting path method and a hybrid procedure combining the advantages of both concepts. Extensive computational results are reported.
0 references
computational study
0 references
bottleneck assignment
0 references
threshold method
0 references
shortest augmenting path concept
0 references
theoretical equivalence
0 references
computational behaviour
0 references
labeling technique
0 references
hybrid procedure
0 references
computational results
0 references
