Alternate strategies for solving bottleneck assignment problems - analysis and computational results (Q798564): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Ulrich Derigs / rank | |||
| Property / author | |||
| Property / author: Ulrich Derigs / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An augmenting path method for solving linear bottleneck assignment problems / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02240182 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W53740398 / rank | |||
Normal rank | |||
Latest revision as of 09:14, 30 July 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
