A. F. Bouyssou-d and . Monjardet-b, Utility maximisation, choice and preference, Studies in Economic Theory, vol.16, 2007.

B. and G. A. Hudry-o, Median linear orders: heuristics and a branch and bound algorithm, European Journal of Operational Research, vol.42, pp.313-325, 1989.

B. Hudry-o, I. G. Roberts-f, and . Tesman-b, The reversing number of a digraph, Discrete Applied Mathematics, vol.60, pp.39-76, 1995.

B. Leclerc-b, The median procedure for partitions, in Partitioning data sets, I, pp.3-34, 1995.

B. Leclerc-b and . Monjardet-b, On the use of ordered sets in problems of comparison and consensus of classifications, Journal of Classification, vol.3, pp.187-224, 1986.

B. R. Mcmorris-f, The median procedure for n-trees, Journal of Classification, vol.3, pp.329-334, 1986.

B. R. Mcmorris-f, On an independence condition for consensus n-trees, Applied Mathematics Letters, vol.2, issue.1, pp.75-78, 1989.

B. R. Mcmorris-f and . C. Powers-r, Independence conditions for consensus n-trees revisited, Applied Mathematics Letters, vol.4, issue.5, pp.43-46, 1991.

B. Mcmorris and F. R. Powers-r, Dictatorial consensus functions on n-trees, Mathematical Social Sciences, vol.25, pp.59-64, 1992.

B. Monjardet-b, The median procedure in cluster analysis and social choice theory, Mathematical Social Sciences, vol.1, issue.3, pp.235-267, 1981.

B. Monjardet-b, The median procedure in data analysis: new results and open problems, in Classification and related methods in data analysis, pp.309-316, 1988.

B. Iii, J. J. , T. C. , and T. M. , Voting schemes for which it can be difficult to tell who won the election, Social Choice and Welfare, vol.6, pp.157-165, 1989.

B. Kodratoff-y, Une heuristique pour le calcul de l'indice de transitivité d'un tournoi, pp.83-92, 1976.

C. N. Leclerc-b and . Monjardet-b, Ensembles ordonnés finis : concepts, résultats, usages, 2007.

C. P. , T. S. Yeo, and A. , The minimum feedback arc set problem is NP-hard for tournaments, Combinatorics, Probability and Computing, vol.16, issue.1, pp.1-4, 2007.
URL : https://hal.archives-ouvertes.fr/lirmm-00140321

C. I. and G. A. Hudry-o, Encadrement de l'indice de Slater d'un tournoi à l'aide de ses scores, Mathématiques, Informatique et Sciences humaines, vol.118, pp.53-68, 1992.

C. I. and G. A. Hudry-o, Utilisation des scores dans des méthodes exactes déterminant les ordres médians des tournois, Mathématiques, Informatique et Sciences humaines, vol.119, pp.53-74, 1992.

C. I. , G. A. Hudry-o, and . Woirgard-f, A bonsaï branch and bound method applied to voting theory, Ordinal and Symbolic Data Analysis, pp.309-318, 1996.

C. I. , G. A. Hudry-o, and . Woirgard-f, New results on the computation of median orders, Discrete Mathematics, pp.165-166, 1997.

C. I. Hudry-o, The noising method: a new method for combinatorial optimization, Operations Research Letters, vol.14, pp.133-137, 1993.

C. I. Hudry-o, Lamarckian genetic algorithms applied to the aggregation of preferences, Annals of Operations Research, vol.80, pp.281-297, 1998.

C. I. Hudry-o, Slater orders and Hamiltonian paths of tournaments, Electronic Notes in Discrete Mathematics, vol.5, pp.60-63, 2000.

C. I. Hudry-o, The noising methods: a generalization of some metaheuristics, European Journal of Operational Research, vol.135, issue.1, pp.86-101, 2001.

C. I. Hudry-o, The noising methods: a survey, in Essays and Surveys in, pp.245-261, 2002.

C. I. Hudry-o, Links between the Slater index and the Ryser index of tournaments, Graphs and Combinatorics, vol.19, issue.3, pp.309-322, 2003.

C. I. Hudry-o, A branch and bound algorithm to solve the linear ordering problem for weighted tournaments, Discrete Applied Mathematics, vol.154, pp.2097-2116, 2006.

C. I. Hudry-o, Noising methods for a clique partitioning problem, Discrete Applied Mathematics, vol.154, issue.5, pp.754-769, 2006.

C. I. Hudry-o, A survey on the linear ordering problem for weighted or unweighted tournaments, 4OR: A Quarterly Journal of Operations Research, vol.5, issue.1, pp.5-60, 2007.

C. I. Hudry-o, Application of the " descent with mutations " metaheuristic to a clique partitioning problem, Proceedings of 2007 IEEE International Conference on Research, Innovation and Vision for the Future, Vietnam, pp.29-35, 2007.

C. I. Hudry-o, Self-tuning of the noising methods, pp.1-21, 2009.

C. I. Hudry-o, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Annals of Operations Research, vol.175, pp.107-158, 2010.

C. I. Hudry-o and . Woirgard-f, A 16-vertex tournament for which Banks set and Slater set are disjoint, Discrete Applied Mathematics, vol.80, issue.2-3, pp.211-215, 1997.

C. , M. J. Caritat, and M. De, Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix, Imprimerie royale, Paris; facsimile version, 1785.

D. B. Priestley-h, Introduction to lattices and order, 2001.

D. W. Mcmorris-f, Axiomatic Consensus Theory in Group Choice and Biomathematics, 2003.

D. Amorim, S. G. Barthélemy-j.-p, and R. C. , Clustering and clique partitioning: Simulated annealing and tabu search approaches, Journal of Classification, vol.12, issue.1, pp.17-42, 1992.
DOI : 10.1007/BF02618466

D. F. Leclerc-b, Closure systems, implicational systems, overhanging relations and the case of hierarchical classification, Mathematical Social Sciences, vol.47, issue.3, pp.349-366, 2004.

D. F. Leclerc-b, Consensus of classification systems, with Adams's results revisited, pp.417-428, 2004.

D. F. Leclerc-b, The structure of the overhanging relations associated with some types of closure systems, Annals of Mathematics and Artificial Intelligence, vol.49, pp.137-149, 2007.

D. C. Kumar-r, . Naor-m, and . Sivakumar-d, Rank aggregation methods for the Web, Proceedings of the 10th International Conference on World Wide Web (WWW10), pp.613-622, 2001.

E. D. Monjardet-b, Guilbaud's 1952 theorem on the logical problem of aggregation, Mathématiques et Sciences humaines 189, 2010.

F. P. Rubinstein-a, Aggregation of equivalence relations, Journal of Classification, vol.3, issue.1, pp.61-65, 1986.

G. G. Th, Les théories de l'intérêt général et le problème logique de l'agrégation, Économie appliquée 5, 501-584. English translation: Theories of the general interest and the logical problem of aggregation, Electronic Journal for History of Probability and Statistics, vol.4, 1952.

G. G. Th and R. P. , Analyse algébrique d'un scrutin, Mathématiques et Sciences humaines, vol.4, pp.9-33, 1963.

H. E. Spakowski-h and . Vogel-j, The complexity of Kemeny elections, Theoretical Computer Science, vol.349, pp.382-391, 2005.

H. O. Leclerc-b and B. Monjardet-b, Metric and latticial medians, in Concepts and methods of decision-making, pp.811-856, 2009.

L. B. Monjardet-b, Latticial theory of consensus, in Social choice, Welfare and Ethics, pp.145-160, 1995.

M. T. Mcmorris and F. R. , Consensus n-trees, Bulletin of Mathematical Biology, vol.43, pp.239-244, 1981.

M. A. Sonnenschein-h, General possibility theorems for group decisions, The Review of Economic Studies, vol.39, pp.185-192, 1972.

M. F. Mulder-h and . C. Powers-r, The median function on median graphs and semilattices, Discrete Applied Mathematics, vol.101, pp.221-230, 2000.

Ö. P. Vaskelainen-v, A tournament of order 14 with disjoint Banks and Slater sets, Discrete Applied Mathematics, vol.158, issue.5, pp.588-591, 2010.

R. A. Fishburn-p, Algebraic aggregation theory, Journal of Economic Theory, vol.38, issue.1, pp.63-77, 1986.

Y. H. Levenglick-a, A Consistent Extension of Condorcet's Election Principle, SIAM Journal on Applied Mathematics, vol.35, pp.285-300, 1978.