Compute the Median Ranking(s) According to the Kemeny's Axiomatic Approach
Overview
Compute the median ranking according to the Kemeny's axiomatic approach. Rankings can or cannot contain ties, rankings can be both complete or incomplete. The package contains both branch-and-bound algorithms and heuristic solutions recently proposed. The searching space of the solution can either be restricted to the universe of the permutations or unrestricted to all possible ties. The package also provide some useful utilities for deal with preference rankings, including both element-weight Kemeny distance and correlation coefficient. This release includes also the median constrained bucket order algorithm. This release removes the functions previously declared as deprecated. These functions are now defunct and no longer available in the package. Essential references: Emond, E.J., and Mason, D.W. (2002) doi:10.1002/mcda.313; D'Ambrosio, A., Amodio, S., and Iorio, C. (2015) doi:10.1285/i20705948v8n2p198; Amodio, S., D'Ambrosio, A., and Siciliano R. (2016) doi:10.1016/j.ejor.2015.08.048; D'Ambrosio, A., Mazzeo, G., Iorio, C., and Siciliano, R. (2017) doi:10.1016/j.cor.2017.01.017; Albano, A., and Plaia, A. (2021) doi:10.1285/i20705948v14n1p117; D'Ambrosio, A., Iorio, C., Staiano, M. and Siciliano, R (2019) <doi: 10.1007/s00180-018-0858-z>.
Install
Health
- OK13 OK2026-08-05
- NOTE12 OK, 1 NOTE2026-08-01
- OK13 OK2026-06-09
- ERROR12 OK, 1 ERROR2026-06-08
- OK14 OK2026-04-22
Show 2 earlier changesHide 2 earlier changes
- ERROR13 OK, 1 ERROR2026-04-18
- OK14 OK2026-03-10
Documentation
- Help pages
- 32 (1 internal)includes a package overview page
- Examples that run
- 92%24 run in a plain check · 2 never run
- Exported functions with examples
- 83%
- Documented parameters
- 100%
- Return-value docs
- 96%
- Help pages citing references
- 63%
Downloads
Dependencies
Installing ConsRank adds 28 packages (19 with compiled code, 28 MB of source tarballs). Heaviest: stringi 11 MB, data.table 5.7 MB, Rcpp 1.8 MB.
Code & Tests
Datasets
People & History
Pick two releases to compare their code metrics.
- RR 4.6.0 released · 2026-04-24
- 3.0Latest
- 2.1.52025-04-15 · diff ↗
- RR 4.5.0 released · 2025-04-11
- RR 4.4.0 released · 2024-04-24
- 2.1.42024-01-24 · diff ↗
- RR 4.3.0 released · 2023-04-21
- 2.1.3
- RR 4.2.0 released · 2022-04-22
- 2.1.22021-09-28 · diff ↗
- RR 4.1.0 released · 2021-05-18
- 2.1.12021-03-10 · diff ↗
- RR 4.0.0 released · 2020-04-24
- 2.1.02019-12-05 · diff ↗ ·
removed 14 exports
BBconsensus, BBconsensus2, DECORcore, Penalty, PenaltyBB2, ReorderingBB, branches, childclosint, childtie, combincost, crossover, findbranches, findconsensusBB, mutaterand1added 7 exports
consrank, order2rank, partitions, rank2order, stirling2, tau_x, univranks - RR 3.6.0 released · 2019-04-26
- RR 3.5.0 released · 2018-04-23
Show 10 earlier eventsHide 10 earlier events
- 2.0.1
- RR 3.4.0 released · 2017-04-21
- 2.0.02017-04-09 · diff ↗ ·
removed 1 export
pattern:^[[:alpha:]]+added 29 exports
BBFULL, BBconsensus, BBconsensus2, DECOR, DECORcore, EMCons, FASTDECOR, FASTcons, Penalty, PenaltyBB2, QuickCons, ReorderingBB, Tau_X, branches, childclosint, childtie, combincost, combinpmatr, crossover, findbranches, findconsensusBB, kemenyd, kemenydesign, labels, mutaterand1, polyplot, reordering, scorematrix, tabulaterows - RR 3.3.0 released · 2016-05-03
- 1.0.22015-09-29 · diff ↗
- 1.0.12015-09-25 · diff ↗
- 1.0.02015-09-08 · diff ↗
- 0.0.12015-08-01 · diff ↗
- 0.02015-07-22
- RR 3.2.0 released · 2015-04-16
Package metadata
- First published
- 2015-07-22
- Total releases
- 14 / 11 yrs
- License
- GPL-3 OSI
- Minimum R
- ≥ 4.1.0
- Bundled data
- 11 KB / 8 files
- Download size
- 86 KB
Cite
Cite this package
Run in R for the authors' preferred citation:
citation("ConsRank")This package has no citation file, so citation() returns this entry built from DESCRIPTION.
Cite the R Observatory
For a number measured here: a download total, a coverage figure, an archival date.
From data release v2026-10-23, which the citation names so these numbers can be found later. More on citing and the projects behind them.