Efficient algorithms using subiterative convergence for Kemeny ranking problem (Q107991): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2018.06.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2807007444 / rank
 
Normal rank

Revision as of 21:46, 19 March 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms using subiterative convergence for Kemeny ranking problem
scientific article

    Statements

    98
    0 references
    198-210
    0 references
    October 2018
    0 references
    12 July 2018
    0 references
    0 references
    0 references
    0 references
    Efficient algorithms using subiterative convergence for Kemeny ranking problem (English)
    0 references
    consensus ranking
    0 references
    heuristics
    0 references
    Kemeny distance
    0 references
    Kemeny-Snell distance
    0 references
    median ranking
    0 references
    rank aggregation problem
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references