Utilize este identificador para referenciar este registo:
https://hdl.handle.net/10316/7762
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Pascoal, Marta | - |
dc.contributor.author | Captivo, M. Eugénia | - |
dc.contributor.author | Clímaco, João | - |
dc.date.accessioned | 2009-02-17T11:18:31Z | - |
dc.date.available | 2009-02-17T11:18:31Z | - |
dc.date.issued | 2003 | en_US |
dc.identifier.citation | 4OR: A Quarterly Journal of Operations Research. 1:3 (2003) 243-255 | en_US |
dc.identifier.uri | https://hdl.handle.net/10316/7762 | - |
dc.description.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. | en_US |
dc.language.iso | eng | eng |
dc.rights | openAccess | eng |
dc.title | A note on a new variant of Murty’s ranking assignments algorithm | en_US |
dc.type | article | en_US |
dc.identifier.doi | 10.1007/s10288-003-0021-7 | en_US |
item.fulltext | Com Texto completo | - |
item.grantfulltext | open | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
item.openairetype | article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
crisitem.author.researchunit | CMUC - Centre for Mathematics of the University of Coimbra | - |
crisitem.author.researchunit | INESC Coimbra – Institute for Systems Engineering and Computers at Coimbra | - |
crisitem.author.orcid | 0000-0003-0517-677X | - |
crisitem.author.orcid | 0000-0001-6655-8590 | - |
Aparece nas coleções: | FEUC- Artigos em Revistas Internacionais FCTUC Matemática - Artigos em Revistas Internacionais |
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.