A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments

Discrete Applied Mathematics

Volumn 154, Issue 15, 2006, Pages 2097-2116

  Charon, Irène ^a   Hudry, Olivier ^a  

^a TELECOM PARISTECH   (France)

Author keywords

Branch and bound; Kemeny's problem; Lagrangean relaxation; Linear ordering problem; Median order; Noising methods; Slater's problem; Tournaments

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTION EVALUATION; MATHEMATICAL TRANSFORMATIONS;

BRANCH AND BOUND; KEMENY'S PROBLEM; LAGRANGEAN RELAXATION; LINEAR ORDERING PROBLEM; MEDIAN ORDER; NOISING METHODS; SLATER'S PROBLEM; TOURNAMENTS;

PROBLEM SOLVING;

EID: 33746877523     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.04.020     Document Type: Article

References (62)

1. E.H.L. Aarts, J.K. Lenstra (Eds.), Local Search in Combinatorial Optimization, Wiley, New York, 1997.
2. Arditti D. Un nouvel algorithme de recherche d'un ordre induit par des comparaisons par paires. In: Diday E., et al. (Ed). Data Analysis and Informatics III (1984), North Holland, Amsterdam 323-343
3. Barthélemy J.-P. Social welfare and aggregation procedures: combinatorial and algorithmic aspects. In: Roberts F. (Ed). Graph Theory and Combinatorics in the Biological and Social Sciences, IMA Series (1989), Springer, Berlin
4. Barthélemy J.-P., Flament C., and Monjardet B. Ordered sets and social sciences. In: Rival I. (Ed). Ordered Sets (1989), D. Reidel, Dordrecht 721-758
5. Barthélemy J.-P., Guénoche A., and Hudry O. Median linear orders: heuristics and a branch and bound algorithm. European J. Oper. Res. 41 (1989) 313-325
6. Barthélemy J.-P., Leclerc B., and Monjardet B. On the use of ordered sets in problems of comparison and consensus of classifications. J. Classification 3 (1986) 187-224
7. Barthélemy J.-P., and Monjardet B. The median procedure in cluster analysis and social choice theory. Math. Social Sci. 1 (1981) 235-267
8. Barthélemy J.-P., and Monjardet B. The median procedure in data analysis: new results and open problems. In: Bock H.H. (Ed). Classification and Related Methods of Data Analysis (1988), North Holland, Amsterdam
9. Beasley J.E. Lagrangean relaxation. In: Reeves C.R. (Ed). Modern Heuristic Techniques for Combinatorial Problems (1995), McGraw Hill, London 243-303
10. Bermond J.-C. Ordres à distance minimum d'un tournoi et graphes partiels sans circuits maximaux. Math. Sci. Humaines 37 (1972) 5-25
11. Bermond J.-C., and Kodratoff Y. Une heuristique pour le calcul de l'indice de transitivité d'un tournoi. RAIRO 10 3 (1976) 83-92
12. K. Boenchendorf, Reihenfolgenprobleme/Mean-flow-time sequencing, Mathematical Systems in Economics, vol. 74, Verlagsgruppe Athanäum, hain, Scriptor, Hanstein, 1982.
13. Burkov V.N., and Groppen V.O. Branch cuts in strongly connected graphs and permutation potentials. Automat. Remote Control 6 (1972) 111-119
14. de Cani J.S. Maximum likelihood paired comparison ranking by linear programming. Biometrika 3 (1969) 537-545
15. de Cani J.S. A branch and bound algorithm for maximum likelihood paired comparison ranking. Biometrika 59 (1972) 131-135
16. Charon I., Germa A., and Hudry O. Encadrement de l'indice de Slater d'un tournoi à l'aide de ses scores. Math. Inform. Sci. Humaines 118 (1992) 53-68
17. Charon I., Guénoche A., Hudry O., and Woirgard F. A bonsai{dotless}̈ branch and bound method applied to voting theory. Proceedings of the International Conference on Ordinal and Symbolic Data Analysis (OSDA), Collection Studies in Classification, Data Analysis, and Knowledge Organization (1996), Springer, Berlin 309-318
18. Charon I., Guénoche A., Hudry O., and Woirgard F. New results on the computation of median orders. Discrete Math. 165-166 (1997) 139-153
19. Charon I., and Hudry O. The noising method: a new method for combinatorial optimization. Oper. Res. Lett. 14 (1993) 133-137
20. Charon I., and Hudry O. Lamarckian genetic algorithms applied to the aggregation of preferences. Ann. Oper. Res. 80 (1998) 281-297
21. Charon I., and Hudry O. The noising methods: a generalization of some metaheuristics. European J. Oper. Res. 135 1 (2001) 86-101
22. I. Charon, O. Hudry, Self-tuning of the noising methods, submitted for publication.
23. Charon I., Hudry O., and Woirgard F. Ordres médians et ordres de Slater des tournois. Math. Inform. Sci. Humaines 133 (1996) 23-56
24. Christof T., and Reinelt G. Combinatorial Optimization and Small Polytopes. Top 4 1 (1996) 1-64
25. Cook W.D., and Saipe A.L. Committee approach to priority planning: the median ranking method. Cahiers Centre Détudes Rech. Opér. 18 3 (1976) 337-352
26. M. Dell'Amico, F. Maffioli, S. Martello (Eds.), Annotated Bibliographies in Combinatorial Optimization, Wiley, Chichester, 1997.
27. Flueck J.A., and Korsh J.F. A branch search algorithm for maximum likelihood paired comparison ranking. Biometrika 61 3 (1974) 621-626
28. Grötschel M., Jünger M., and Reinelt G. A cutting plane algorithm for the linear ordering problem. Oper. Res. 32 (1984) 1195-1220
29. Grötschel M., Jünger M., and Reinelt G. Optimal triangulation of large real-world input-output-matrices. Statist. Hefte 25 (1984) 261-295
30. Grötschel M., Jünger M., and Reinelt G. Acyclic subdigraphs and linear orderings: polytopes, facets, and a cutting plane algorithm. In: Rival I. (Ed). Graphs and Orders (1985), D. Reidel Publishing Company, Dordrecht 217-264
31. Guénoche A. Un algorithme pour pallier l'effet Condorcet. RAIRO 11 1 (1977) 77-83
32. A. Guénoche, A. B. C. D. : logiciel d'analyses booléennes et combinatoires des données, notice d'utilisation, G. R. T. C., Marseille, 1986.
33. A. Guénoche, Order at minimum distance of a valued tournament, communication to Modélisation, Analyse et Agrégation des Préférences et des Choix TRAP 3, Marseille-Luminy, 1988.
34. Guénoche A. How to choose according to partial evaluations. In: Bouchon-Meunier B., et al. (Ed). Advances in Intelligent Computing, IPMU'94, Lecture Notes in Computer Sciences vol. 945 (1995), Springer, Berlin 611-618
35. Guénoche A. Vainqueurs de Kemeny et tournois difficiles. Mathématiques, Informatique et Sciences Humaines 133 (1996) 57-66
36. Guénoche A., Vandeputte-Riboud B., and Denis J.-B. Selecting varieties using a series of trials and a combinatorial ordering method. Agronomie 14 (1994) 363-375
37. Hubert L. Seriation using asymmetric proximity measures. British J. Math. Statist. Psychol. 29 (1976) 32-52
38. O. Hudry, Recherche d'ordres médians : complexité, algorithmique et problèmes combinatoires, Ph.D. thesis, ENST, Paris, 1989.
39. O. Hudry, Tournois et optimisation combinatoire, mémoire d'Habilitation à diriger des recherches, ENST, Paris, 1998.
40. Jünger M. Polyhedral combinatorics and the acyclic subdigraph problem (1985), Heldermann Verlag, Berlin
41. Kaas R. A branch and bound algorithm for the acyclic subgraph problem. European J. Oper. Res. 8 (1981) 355-362
42. Karp R.M. Reducibility among combinatorial problems. In: Miller R.E., and Thatcher J.W. (Eds). Complexity of Computer Computations (1972), Plenum Press, New York 85-103
43. Kemeny J.G. Mathematics without numbers. Daedalus 88 (1959) 577-591
44. Kendall M.G., and Babington Smith B. On the method of paired comparisons. Biometrika 33 (1940) 239-251
45. Korte B., and Oberhofer W. Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems. Unternehmensforschung 12 (1968) 217-231
46. Korte B., and Oberhofer W. Zur Triangulation von Input-Output-Matrizen. Jahrbuch. Nationaloekon. Statist. 182 (1969) 398-433
47. Laporte G., and Osman I.H. Metaheuristics: a bibliography. Ann. Oper. Res. 63 (1996) 513-623
48. H.W. Lenstra, Jr., The acyclic subgraph problem, Technical Report BW26, Mathematisch Centrum, Amsterdam, 1973.
49. Marcotorchino J.-F., and Michaud P. Optimisation en analyse ordinale de données (1979), Masson, Paris
50. Minoux M. Mathematical Programming: Theory and Algorithms (1986), Wiley, New York
51. J.W. Moon, Topics on tournaments, Holt, Rinehart and Winston, New York, 1968.
52. Phillips J.P.N. A procedure for determining Slater's i and all nearest adjoining orders. British J. Math. Statist. Psychol. 20 (1967) 217-225
53. Phillips J.P.N. A further procedure for determining Slater's i and all nearest adjoining orders. British J. Math. Statist. Psychol. 22 (1969) 97-101
54. C. Reeves (Ed.), Modern Heuristic Techniques for Combinatorial Problems, McGraw-Hill, London, 1993.
55. G. Reinelt, The linear ordering problem: algorithms and applications, Research and exposition in mathematics, vol. 8, Heldermann, Verlag, Berlin, 1985.
56. Remage R., and Thompson W.A. Maximum likelihood paired comparison rankings. Biometrika 53 (1966) 143-149
57. Slater P. Inconsistencies in a schedule of paired comparisons. Biometrika 48 (1961) 303-312
58. A.W. Tucker, On directed graphs and integer programs, 1960 Symposium on Combinatorial Problems, Princeton University, USA, 1960.
59. U. Tüshaus, Aggregation binärer Relationen in der qualitativen Datenanalyse, Mathematical Systems in Economics, vol. 82, Verlagsgruppe Athenäum, Hain, Hanstein, 1983.
60. H. Wessels, Triangulation und Blocktriangulation von Input-Output Tabellen, Deutsches Institut für Wirtschaftsforschung: Beiträge zur Strukturforshung, Heft, vol. 63, Berlin, 1981.
61. F. Woirgard, Recherche et dénombrement des ordres médians des tournois, Ph.D. Thesis, ENST, Paris, 1997.
62. Younger D.H. Minimum feedback arc sets for a directed graph. IEEE Trans. Profes. Tech. Group Circuit Theory 10 2 (1963) 238-245