J. P. Barthélemy, A. G. Hudry, and O. , Median linear orders: Heuristics and a branch and bound algorithm, European Journal of Operational Research, vol.42, issue.3, pp.555-579, 1989.
DOI : 10.1016/0377-2217(89)90442-6

J. P. Barthélemy and B. Monjardet, The median procedure in cluster analysis and social choice theory, Mathematical Social Sciences, vol.1, issue.3, pp.235-26710, 1981.
DOI : 10.1016/0165-4896(81)90041-X

J. C. Bermond, Ordrè a distance minimale d'un tournoi et graphes partiels sans circuits maximaux, Mathématiques et Sciences humaines, vol.37, pp.5-25, 1972.

J. C. Borda, Mémoire sur lesélectionsles´lesélections au scrutin, Histoire de l'Académie Royale des Sciences pour 1781?1784, pp.657-664, 1784.

M. J. Caritat and . Marquis-de-condorcet, Essai sur l'application de l'analyse de la probabilité des décisions renduesàrendues, 1785.

I. Charon, A. Guénoche, . Hudry, and F. Woirgard, A bonsa¨?bonsa¨? branch and bound method applied to voting theory, Ordinal and Symbolic Data Analysis, pp.309-318, 1996.
DOI : 10.1007/978-3-642-61159-9_27

I. Charon and O. Hudry, The noising methods: A generalization of some metaheuristics, European Journal of Operational Research, vol.135, issue.1, pp.86-10110, 2001.
DOI : 10.1016/S0377-2217(00)00305-2

G. Finke, R. E. Burkard, and F. Rendl, Quadratic Assignment Problems, Annals of Discrete Mathematics, vol.31, pp.61-82, 1987.
DOI : 10.1016/S0304-0208(08)73232-8

A. Guénoche, Un algorithme pour pallier l'effet, Condorcet. R.A.I.R.O. Recherche Opérationnelle, vol.11, pp.77-83, 1977.

P. Hansen and N. Mladenovi´cmladenovi´c, Variable neighborhood search: Principles and applications, European Journal of Operational Research, vol.130, issue.3, pp.449-46710, 2001.
DOI : 10.1016/S0377-2217(00)00100-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.93.1769

O. Hudry, Recherche d'ordres médians : complexité, algorithmique etprobì emes combinatoires, Thèse de doctorat, ´ Ecole nationale supérieure des télécommunications, 1989.

O. Hudry, On the computation of median linear orders, of median complete preorders and of median weak orders, Mathematical Social Sciences, vol.64, issue.1, 2012.
DOI : 10.1016/j.mathsocsci.2011.06.004

J. G. Kemeny, Mathematics without numbers, Daedalus, vol.88, issue.4, pp.577-591, 1959.

B. Monjardet, Tournoi et ordre médian pour une opinion, Mathématiques et Sciences humaines, vol.43, pp.55-73, 1973.

A. Nijenhuis and H. S. Wilf, Combinatorial algorithms, 1975.

R. Remage and W. A. Thomson, Maximum-likelihood paired comparison rankings, Biometrika, vol.53, issue.1-2, pp.143-149, 1966.
DOI : 10.1093/biomet/53.1-2.143
URL : http://biomet.oxfordjournals.org/cgi/content/short/53/1-2/143

F. Roupin, From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems, Journal of Combinatorial Optimization, vol.8, issue.4, pp.469-493, 2004.
DOI : 10.1007/s10878-004-4838-6
URL : https://hal.archives-ouvertes.fr/hal-00596181

P. Slater, Inconsistencies in a schedule of paired comparisons, Biometrika, vol.48, issue.3-4, pp.303-312, 1961.
DOI : 10.1093/biomet/48.3-4.303

A. F. Smith and C. D. Payne, AN ALGORITHM FOR DETERMINING SLATER'S i AND ALL NEAREST ADJOINING ORDERS, British Journal of Mathematical and Statistical Psychology, vol.27, issue.1, 1974.
DOI : 10.1111/j.2044-8317.1974.tb00526.x

F. Woirgard, Recherche et dénombrement des ordres médians des tournois, Thèse de doctorat, ´ Ecole nationale supérieure des télécommunications, 1997.