This article presents new theoretical and computational developments of the MorK algorithms developed by Azzini and Munda (2020) for finding Kemeny median rankings. Our enhanced Mork-Exact algorithm identifies all Kemeny median rankings for instances with up to 45 alternatives within a reasonable amount of searching time, improving upon the previous tractability threshold of 14. Our MorK-Heuristic algorithm consistently shows a better approximation performance, which we have exhaustively analyzed through a wide range of position-based measures of error. To the best of our knowledge, no such measures of error have been considered before in the related literature. Notwithstanding the NP-hardness of the relevant problem, our results greatly extend the use of the MorK algorithms for practical applications.
AZZINI Ivano;
MORANDI Nicola;
MUNDA Giuseppe;
2026-10-19
ELSEVIER
JRC145484
1872-6860 (online),
https://publications.jrc.ec.europa.eu/repository/handle/JRC145484,
10.1016/j.ejor.2026.05.018 (online),
| Name | Country | City | Type |
|---|
This document is only visible at the Commission level.
You are not authorized to publish or distribute it outside the European Commission.
This is a public document. You can share this publication.
Datasets
| ID | Title | Public URL |
|---|
Dataset collections
| ID | Acronym | Title | Public URL |
|---|
Scripts / source codes
| Description | Public URL |
|---|
Additional supporting files
| File name | Description | File type |
|---|