Heuristic Methods for Top-k List Aggregation Under the Generalized Kendall Tau Distance
- 18 March 2026
- book chapter
- Published by Springer Nature
- p. 18-34
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Approximate Condorcet Partitioning: Solving large-scale rank aggregation problemsComputers & Operations Research, 2023
- Top-k List Aggregation: Mathematical Formulations and Polyhedral Comparisons2022
- Weighted aggregation of partial rankings using Ant Colony OptimizationNeurocomputing, 2017
- A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approachComputers & Operations Research, 2017
- Comparing top-k XML listsInformation Systems, 2013
- PrefLib: A Library for Preferences http://www.preflib.org2013
- Aggregation of Partial Rankings, p-Ratings and Top-m ListsAlgorithmica, 2008
- Methods for comparing rankings of search engine resultsComputer Networks, 2006
- Distance-based and ad hoc consensus models in ordinal preference rankingEuropean Journal of Operational Research, 2006
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955