A note on a new variant of Murty’s ranking assignments algorithm

Detalhes bibliográficos
Autor(a) principal: Pascoal, Marta
Data de Publicação: 2003
Outros Autores: Captivo, M. Eugénia, Clímaco, João
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10316/7762
https://doi.org/10.1007/s10288-003-0021-7
Resumo: 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.
id RCAP_176ee09f62258fcfe049a71311049e44
oai_identifier_str oai:estudogeral.uc.pt:10316/7762
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling A note on a new variant of Murty’s ranking assignments algorithmIn 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.2003info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/7762http://hdl.handle.net/10316/7762https://doi.org/10.1007/s10288-003-0021-7eng4OR: A Quarterly Journal of Operations Research. 1:3 (2003) 243-255Pascoal, MartaCaptivo, M. EugéniaClímaco, Joãoinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2020-05-29T10:04:36Zoai:estudogeral.uc.pt:10316/7762Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T21:00:45.517759Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv A note on a new variant of Murty’s ranking assignments algorithm
title A note on a new variant of Murty’s ranking assignments algorithm
spellingShingle A note on a new variant of Murty’s ranking assignments algorithm
Pascoal, Marta
title_short A note on a new variant of Murty’s ranking assignments algorithm
title_full A note on a new variant of Murty’s ranking assignments algorithm
title_fullStr A note on a new variant of Murty’s ranking assignments algorithm
title_full_unstemmed A note on a new variant of Murty’s ranking assignments algorithm
title_sort A note on a new variant of Murty’s ranking assignments algorithm
author Pascoal, Marta
author_facet Pascoal, Marta
Captivo, M. Eugénia
Clímaco, João
author_role author
author2 Captivo, M. Eugénia
Clímaco, João
author2_role author
author
dc.contributor.author.fl_str_mv Pascoal, Marta
Captivo, M. Eugénia
Clímaco, João
description 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.
publishDate 2003
dc.date.none.fl_str_mv 2003
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10316/7762
http://hdl.handle.net/10316/7762
https://doi.org/10.1007/s10288-003-0021-7
url http://hdl.handle.net/10316/7762
https://doi.org/10.1007/s10288-003-0021-7
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 4OR: A Quarterly Journal of Operations Research. 1:3 (2003) 243-255
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799133897645096960

Registros relacionados