In this paper a variant of Murty's algorithm for ranking assignments according to cost is presented. It is shown that the worst-case computational complexity is better in this variant than in the original form of the algorithm. Computational results comparing three methods for ranking assignments are reported. They show that the behaviour of the new variant is also better in practice. © 2003 Springer-Verlag Berlin/Heidelberg.
A note on a new variant of Murty's ranking assignments algorithm
Pascoal M.;
2003-01-01
Abstract
In this paper a variant of Murty's algorithm for ranking assignments according to cost is presented. It is shown that the worst-case computational complexity is better in this variant than in the original form of the algorithm. Computational results comparing three methods for ranking assignments are reported. They show that the behaviour of the new variant is also better in practice. © 2003 Springer-Verlag Berlin/Heidelberg.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
034ORb.pdf
Accesso riservato
:
Publisher’s version
Dimensione
144.69 kB
Formato
Adobe PDF
|
144.69 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
