A note on a new variant of Murty’s ranking assignments algorithm
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 ar...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Language: | eng |
| Published: |
2003
|
| Online Access: | http://hdl.handle.net/10316/7762 |
| Country: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/7762 |