Find a first approximation to the consensus ranking.

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

`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 |

`cons ` |
a first approximation to be the consensus ranking |

`pen ` |
penalty value |

Antonio D'Ambrosio <antdambr@unina.it>

Amodio, S., D'Ambrosio, A. & Siciliano, R (2015). Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach. European Journal of Operational Research. DOI: 10.1016/j.ejor.2015.08.048.

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.