Approaching the rank aggregation problem by local search-based metaheuristics (Q2423564): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cam.2018.03.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2801447997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3806565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments with Kemeny ranking: What works when? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5671815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voting schemes for which it can be difficult to tell who won the election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing Partial Rankings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive partitioning method for the prediction of preference rankings based upon Kemeny distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized approximation algorithm for computing bucket orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tackling the rank aggregation problem with evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using extension sets to aggregate partial rankings in a flexible setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and analysis of stochastic local search for the multiobjective traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the vertex separation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear ordering problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighbourhood search: methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NEW MEASURE OF RANK CORRELATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated local search for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search and GRASP for the maximum diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The original Borda count and partial voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187195 / rank
 
Normal rank

Revision as of 15:19, 19 July 2024

scientific article
Language Label Description Also known as
English
Approaching the rank aggregation problem by local search-based metaheuristics
scientific article

    Statements

    Approaching the rank aggregation problem by local search-based metaheuristics (English)
    0 references
    0 references
    0 references
    0 references
    20 June 2019
    0 references
    0 references
    ranking
    0 references
    rank aggregation problem
    0 references
    metaheuristic algorithm
    0 references
    Kendall distance
    0 references
    permutation
    0 references
    partial ranking
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references