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 |

a "list" containing the following components:

cons | a first approximation of the median ranking | |

pen | penalty value |

Antonio D'Ambrosio antdambr@unina.it

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.

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

Please suggest features or report bugs with the GitHub issue tracker.

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

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.