In this paper we explore the possibility of deriving consensus rankings by solving consensus optimization problems, characterizing consensus rankings as suitable complete order relations minimizing the average Kemeny-Snell distance to the individual rankings. This optimization problem can be expressed as a binary programming (BP) problem which can typically be solved reasonably efficiently. The underlying theory is discussed in Sect. 1. Applications of the proposed method given in Sect. 2 include a comparison to other mathematical programming (MP) approaches using the data set of Tse [9] and establishing a consensus ranking of marketing journals identified by domain experts from a subset of the Harzing journal quality list [2]. In Sect. 3 we discuss computational details and present the results of a benchmark experiment comparing the performance of the commercial solver CPLEX to three open source mixed integer linear programming (MILP) solvers
[1]
P. R. Chandy,et al.
Awareness and Evaluation of Selected Marketing Journals Inside and outside the Discipline: An Empirical Study
,
1990
.
[2]
Yoshiko Wakabayashi.
The Complexity of Computing Medians of Relations
,
1998
.
[3]
John Mingers,et al.
Ranking journals in business and management: a statistical analysis of the Harzing data set
,
2007,
Eur. J. Inf. Syst..
[4]
S. Régnier,et al.
Sur quelques aspects mathématiques des problèmes de classification automatique
,
1983
.
[5]
Alan C.B. Tse,et al.
Using mathematical programming to solve large ranking problems
,
2001,
J. Oper. Res. Soc..
[6]
Kurt Hornik,et al.
Deriving Consensus Rankings from Benchmarking Experiments
,
2006,
GfKl.
[7]
I Horowitz.
Preference-neutral attribute weights in the journal-ranking problem
,
2003,
J. Oper. Res. Soc..