Partial evaluation in rank aggregation problems

DOI10.1016/j.cor.2016.09.013zbMath1391.90645OpenAlexW2522027564MaRDI QIDQ1652087

Alejandro Rosete, José A. Gámez, Juan A. Aledo

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.09.013

zbMATH Keywords

rankingmetaheuristicspartial evaluationneighborhoodsurrogate functionrank aggregation problem (RAP)

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09) Statistical ranking and selection procedures (62F07)

Related Items

Scheduling interrelated activities in complex projects under high-order rework: a DSM-based approach ⋮ A data-driven matching algorithm for ride pooling problem ⋮ Median constrained bucket order rank aggregation ⋮ Ensemble framework for causality learning with heterogeneous directed acyclic graphs through the lens of optimization ⋮ Approximate Condorcet partitioning: solving large-scale rank aggregation problems ⋮ Block-insertion-based algorithms for the linear ordering problem

Uses Software

• PrefLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
• A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances
• Experiments with Kemeny ranking: What works when?
• Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
• Knowledge incorporation in evolutionary computation
• A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms
• Tackling the rank aggregation problem with evolutionary algorithms
• Computing distances between partial rankings
• Using extension sets to aggregate partial rankings in a flexible setting
• A surrogate-based multiobjective metaheuristic and network degradation simulation model for robust toll pricing
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• The linear ordering problem revisited
• Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
• Efficient local search algorithms for the linear ordering problem
• NON-NULL RANKING MODELS. I
• Preference Learning
• A new rank correlation coefficient with application to the consensus ranking problem
• A NEW MEASURE OF RANK CORRELATION

This page was built for publication: Partial evaluation in rank aggregation problems