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)