BBconsensus: Find the first approximation to the consensus ranking. Most...

Description Usage Arguments Value Author(s) References

View source: R/ALL.r View source: R/BBconsensus.R

Description

Find a first approximation to the consensus ranking.

Usage

1
BBconsensus(RR, cij, FULL = FALSE, PS = FALSE)

Arguments

RR

Candidate to be the consensus ranking

cij

Combined input matrix of the data set

FULL

Default FULL=FALSE. If FULL=TRUE, the searching is limited to the space of complete rankings. FULL=TRUE if the function is called by BBFULL algorithm.

PS

Default PS=FALSE. If PS=TRUE the number of evaluated branches is diplayed

Value

a "list" containing the following components:

cons a first approximation of the median ranking
pen penalty value

Author(s)

Antonio D'Ambrosio antdambr@unina.it

References

Amodio, S., D'Ambrosio, A. and Siciliano, R. (2016). Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach. European Journal of Operational Research, 249(2), 667-676.


ConsRank documentation built on May 30, 2017, 3:05 a.m.

Search within the ConsRank package
Search all R packages, documentation and source code