A note on a new variant of Murty's ranking assignments algorithm (Q1416101): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Marta M. B. Pascoal / rank | |||
Property / author | |||
Property / author: Q286527 / rank | |||
Property / author | |||
Property / author: Marta M. B. Pascoal / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Joao Carlos Namorado Climaco / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10288-003-0021-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2583771118 / rank | |||
Normal rank |
Latest revision as of 03:32, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on a new variant of Murty's ranking assignments algorithm |
scientific article |
Statements
A note on a new variant of Murty's ranking assignments algorithm (English)
0 references
2003
0 references
The ranking assignments problem is a generalization of a well-known assignment problem [\textit{H. W. Kuhn}, ''The Hungarian method for the assignment problem''. Metody Algoritmy Resheniya Transportnoi Zadachi 1, 35--52 (1963); translation from Naval Res. Logist. Quart. 2, 83--97 (1955; Zbl 0143.41905)]. The aim is to compute the \(K\) least cost assignments. In the present paper, the two algorithms for solving the ranking assignments problem are reviewed [\textit{K. G. Murty}, ''An algorithm for ranking all the assignments in incerasing order of cost''. Oper. Res. 16, 682--687 (1968; Zbl 0214.18705)] and [\textit{C. R. Chegireddy, H. W. Hamacher}, ''Algorithms for finding K-best perfect matchings''. Discrete Appl. Math. 18, 155--165 (1987; Zbl 0621.05026)] and a new variant of Murty's algorithm is proposed. Computational results are presented which show that the behaviour of the new variant is better in practice than Murty's algorithm.
0 references
combinatorial optimization
0 references
graph theory
0 references
mathematical programing
0 references