Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/7762
Title: | A note on a new variant of Murty’s ranking assignments algorithm | Authors: | Pascoal, Marta Captivo, M. Eugénia Clímaco, João |
Issue Date: | 2003 | Citation: | 4OR: A Quarterly Journal of Operations Research. 1:3 (2003) 243-255 | 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. | URI: | https://hdl.handle.net/10316/7762 | DOI: | 10.1007/s10288-003-0021-7 | Rights: | openAccess |
Appears in Collections: | FEUC- Artigos em Revistas Internacionais FCTUC Matemática - Artigos em Revistas Internacionais |
Show full item record
SCOPUSTM
Citations
22
checked on Apr 1, 2024
WEB OF SCIENCETM
Citations
5
21
checked on Apr 2, 2024
Page view(s)
241
checked on Apr 16, 2024
Download(s)
99
checked on Apr 16, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.