Autor(es):
Pascoal, Marta 
; Captivo, M. Eugénia ; Clímaco, João
Data: 2003
Identificador Persistente: http://hdl.handle.net/10316/7762
Origem: Estudo Geral - Universidade de Coimbra
Detalhes do Documento
A note on a new variant of Murty’s ranking assignments algorithm
Descrição
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. http://dx.doi.org/10.1007/s10288-003-0021-7
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. http://dx.doi.org/10.1007/s10288-003-0021-7
Tipo de Documento
Artigo
Idioma Inglês
Idioma Inglês
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||