Alternate strategies for solving bottleneck assignment problems - analysis and computational results (Q798564)
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: Alternate strategies for solving bottleneck assignment problems - analysis and computational results |
scientific article; zbMATH DE number 3871027
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Alternate strategies for solving bottleneck assignment problems - analysis and computational results |
scientific article; zbMATH DE number 3871027 |
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
0.8198262453079224
0 references
0.7963037490844727
0 references
0.7877213954925537
0 references
0.7849262356758118
0 references
0.7795653343200684
0 references
