Utilize este identificador para referenciar este registo: https://hdl.handle.net/10316/7762
Campo DCValorIdioma
dc.contributor.authorPascoal, Marta-
dc.contributor.authorCaptivo, M. Eugénia-
dc.contributor.authorClímaco, João-
dc.date.accessioned2009-02-17T11:18:31Z-
dc.date.available2009-02-17T11:18:31Z-
dc.date.issued2003en_US
dc.identifier.citation4OR: A Quarterly Journal of Operations Research. 1:3 (2003) 243-255en_US
dc.identifier.urihttps://hdl.handle.net/10316/7762-
dc.description.abstractIn 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.isoengeng
dc.rightsopenAccesseng
dc.titleA note on a new variant of Murty’s ranking assignments algorithmen_US
dc.typearticleen_US
dc.identifier.doi10.1007/s10288-003-0021-7en_US
item.fulltextCom Texto completo-
item.grantfulltextopen-
item.languageiso639-1en-
item.cerifentitytypePublications-
item.openairetypearticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.researchunitCMUC - Centre for Mathematics of the University of Coimbra-
crisitem.author.researchunitINESC Coimbra – Institute for Systems Engineering and Computers at Coimbra-
crisitem.author.orcid0000-0003-0517-677X-
crisitem.author.orcid0000-0001-6655-8590-
Aparece nas coleções:FEUC- Artigos em Revistas Internacionais
FCTUC Matemática - Artigos em Revistas Internacionais
Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato
obra.pdf144.69 kBAdobe PDFVer/Abrir
Mostrar registo em formato simples

Google ScholarTM

Verificar

Altmetric

Altmetric


Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.