BBconsensus2

If PS=true, it prints the evaluating branches

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.

FULL

Core function in computing consensus ranking as defined by Emond and Mason (2002), recalled by EMCons function

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 package also provide some useful utilities for deal with preference rankings.
Essential references:
Emond, E.J., and Mason, D.W. (2002) <doi:10.1002/mcda.313>;
D'Ambrosio, A., Amodio, S., and Iorio, C. (2015) <doi:10.1285/i20705948v8n2p198>;
Amodio, S., D'Ambrosio, A., and Siciliano R. (2016) <doi:10.1016/j.ejor.2015.08.048>;
D'Ambrosio, A., Mazzeo, G., Iorio, C., and Siciliano, R. (2017) <doi:10.1016/j.cor.2017.01.017>.

Last chance! 50% off unlimited learning

BBconsensus2: Core function in computing consensus ranking as defined by Emond and Mason (2002)

Description

Usage

Arguments

Value

References

See Also