exactalgorithmcplexforpaperoptim1

class corankco.algorithms.exact.exactalgorithmcplexforpaperoptim1.ExactAlgorithmCplexForPaperOptim1

A class to perform exact optimization on the rank aggregation problem using CPLEX linear programming. This class was used for the experiments presented in Andrieu et al., IJAR, 2023. The objective is to consider only one of the possible optimizations: a sufficient condition to ensure that at least one optimal consensus is a ranking without ties This class only re-defines the function to get personalized contraints based on sufficient conditions.

More information can be found in the following article: Andrieu et al., IJAR, 2023.

get_full_name() str

Return the full name of the algorithm.

Returns:

The string ‘Exact algorithm ILP Cplex’.

Return type:

str