Efficient algorithms using subiterative convergence for Kemeny ranking problem
Year of publication: |
October 2018
|
---|---|
Authors: | Badal, Prakash S. ; Das, Ashish |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 98.2018, p. 198-210
|
Subject: | Consensus ranking | Heuristics | Kemeny distance | Kemeny-Snell distance | Median ranking | Rank aggregation problem | Ranking-Verfahren | Ranking method | Theorie | Theory | Heuristik | Aggregation | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
D'Ambrosio, Antonio, (2017)
-
The linear ordering problem with clusters : a new partial ranking
Alcaraz, Javier, (2020)
-
Bilevel integer linear models for ranking items and sets
Labbé, Martine, (2023)
- More ...
-
On the construction of restricted minimum aberration designs
Suen, Chung-yi, (2014)
-
ON OPTIMALITY OF SOME PARTIAL DIALLEL CROSS DESIGNS
Das, Ashish, (1998)
-
Andersen, Torben G., (2001)
- More ...