Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem
From MaRDI portal
Publication:724004
DOI10.1016/j.ejor.2018.04.031zbMath1403.90557OpenAlexW2802314900WikidataQ129932276 ScholiaQ129932276MaRDI QIDQ724004
Alejandro Rosete, José A. Gámez, Juan A. Aledo
Publication date: 25 July 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.04.031
combinatorial optimizationevolution strategiesrank aggregationweak orderconsensus rankingoptimal bucket order problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A correspondence between voting procedures and stochastic orderings, Median constrained bucket order rank aggregation, Multi-dimensional Bayesian network classifiers for partial label ranking, Ensemble learning for the partial label ranking problem, Block-insertion-based algorithms for the linear ordering problem
Uses Software
Cites Work
- Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
- A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
- A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances
- A new proposal for fusing individual preference orderings by rank-ordered agents: a generalization of the Yager's algorithm
- Experiments with Kemeny ranking: What works when?
- Rank aggregation in cyclic sequences
- The complexity of Kemeny elections
- Tackling the rank aggregation problem with evolutionary algorithms
- A Bayesian approach to seriation problems in archaeology
- A randomized approximation algorithm for computing bucket orders
- Voting schemes for which it can be difficult to tell who won the election
- Using extension sets to aggregate partial rankings in a flexible setting
- The original Borda count and partial voting
- Distance-based and ad hoc consensus models in ordinal preference ranking
- The linear ordering problem revisited
- An axiomatic approach to distance on partial orderings
- A new rank correlation coefficient with application to the consensus ranking problem
- Ranking Tournaments
- Aggregating inconsistent information
- Variable neighborhood search: Principles and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
