|
Find correct branches in the Branch-and-Bound algorithms
● Data Source:
CranContrib
● Keywords:
● Alias: findbranches
●
0 images
|
|
Compute the median ranking according the Kemeny's axiomatic approach. Rankings can or cannot contain ties, rankings can be both complete or incomplete.
● Data Source:
CranContrib
● Keywords: package
● Alias: ConsRank, ConsRank-package
●
0 images
|
|
Find a first approximation to the consensus ranking.
● Data Source:
CranContrib
● Keywords:
● Alias: BBconsensus
●
0 images
|
|
Given a ranking, it computes the score matrix as defined by Emond and Mason (2002)
● Data Source:
CranContrib
● Keywords: Score matrix
● Alias: scorematrix
●
0 images
|
|
Compute the Kemeny distance of a data matrix containing preference rankings, or compute the kemeny distance between two (matrices containing) rankings.
● Data Source:
CranContrib
● Keywords: Kemeny distance
● Alias: kemenyd
●
0 images
|
|
Given a ranking of M objects (or a matrix with M columns), it reduces it in "natural" form (i.e., with integers from 1 to M)
● Data Source:
CranContrib
● Keywords:
● Alias: reordering
●
0 images
|
Plot rankings a permutation polytope that is the geometrical space of preference rankings. The plot is available for 3 or for 4 objects
● Data Source:
CranContrib
● Keywords: Permutation polytopes
● Alias: polyplot
●
2 images
|
|
Given a sample of preference rankings, it compute the frequency associated to each ranking
● Data Source:
CranContrib
● Keywords: modal ranking
● Alias: tabulaterows
●
0 images
|
|
Assign a penalty to the branches of the BB algorithms
● Data Source:
CranContrib
● Keywords:
● Alias: PenaltyBB2
●
0 images
|
|
Auxiliary function: it finds a first ranking candidate to be the consensus ranking by observing the Combined input matrix
● Data Source:
CranContrib
● Keywords:
● Alias: findconsensusBB
●
0 images
|
providing 
.