{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T14:24:18Z","timestamp":1770906258503,"version":"3.50.1"},"reference-count":255,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,3,17]],"date-time":"2007-03-17T00:00:00Z","timestamp":1174089600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2007,3,26]]},"DOI":"10.1007\/s10288-007-0036-6","type":"journal-article","created":{"date-parts":[[2007,3,16]],"date-time":"2007-03-16T03:28:09Z","timestamp":1174015689000},"page":"5-60","source":"Crossref","is-referenced-by-count":48,"title":["A survey on the linear ordering problem for weighted or unweighted tournaments"],"prefix":"10.1007","volume":"5","author":[{"given":"Ir\u00e8ne","family":"Charon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Hudry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,3,17]]},"reference":[{"key":"36_CR1","unstructured":"Ad\u00e1m A (1964) Problem. In: Theory of graphs and its applications. Proc Coll Smolenice, Czech Acad Sci Publ"},{"key":"36_CR2","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/rsa.1010","volume":"18","author":"I Adler","year":"2001","unstructured":"Adler I, Alon N, Ross SM (2001) On the number of Hamiltonian paths in tournaments. Random Struct Alg 18:291\u2013296","journal-title":"Random Struct Alg"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Ailon N, Alon N (2007) Hardness of fully dense problems (submitted)","DOI":"10.1016\/j.ic.2007.02.006"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Ailon N, Charikar M, Newman A (2005) Aggregating inconsistent information: ranking and clustering. In: Proceedings of the 37th annual ACM symposium on Theory of computing (STOC): 684\u2013693","DOI":"10.1145\/1060590.1060692"},{"key":"36_CR5","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1287\/mnsc.32.6.660","volume":"32","author":"I Ali","year":"1986","unstructured":"Ali I, Cook WD, Kress M (1986) On the minimum violations ranking of a tournament. Manage Sci 32:660\u2013674","journal-title":"Manage Sci"},{"key":"36_CR6","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF02128667","volume":"10","author":"N Alon","year":"1990","unstructured":"Alon N (1990) The maximum number of Hamiltonian paths in tournaments. Combinatorica 10: 319\u2013324","journal-title":"Combinatorica"},{"issue":"1","key":"36_CR7","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1137\/050623905","volume":"20","author":"N Alon","year":"2006","unstructured":"Alon N (2006) Ranking tournaments. SIAM J Discrete Mathe 20(1):137\u2013142","journal-title":"SIAM J Discrete Mathe"},{"key":"36_CR8","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The probabilistic method","author":"N Alon","year":"2000","unstructured":"Alon N, Spencer J (2000) The probabilistic method, 2nd edn. Wiley, New York","edition":"2"},{"key":"36_CR9","doi-asserted-by":"crossref","first-page":"283","DOI":"10.4153\/CMB-1967-028-6","volume":"10","author":"B Alspach","year":"1967","unstructured":"Alspach B (1967) Cycles of each length in regular tournaments. Can Math Bull 10:283\u2013286","journal-title":"Can Math Bull"},{"key":"36_CR10","doi-asserted-by":"crossref","first-page":"655","DOI":"10.4153\/CMB-1968-078-3","volume":"11","author":"B Alspach","year":"1968","unstructured":"Alspach B (1968) A combinatorial proof of a conjecture of Goldberg and Moon. Can Math Bull 11:655\u2013661","journal-title":"Can Math Bull"},{"key":"36_CR11","unstructured":"Arditti D (1984) Un nouvel algorithme de recherche d\u2019un ordre induit par des comparaisons par paires. In: Diday E et\u00a0al. (eds). Data analysis and informatics III. North Holland, Amsterdam, 323\u2013343"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Arora S, Frieze A, Kaplan H (1996) A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. In: Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS):2433","DOI":"10.1109\/SFCS.1996.548460"},{"key":"36_CR13","volume-title":"Complexity and approximation","author":"G Ausiello","year":"2003","unstructured":"Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti-Spaccamela A, Protasi M (2003) Complexity and approximation, 2nd edn. Springer, Berlin","edition":"2"},{"key":"36_CR14","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1111\/j.2044-8317.1977.tb00735.x","volume":"30","author":"FB Baker","year":"1977","unstructured":"Baker FB, Hubert LJ (1977) Applications of combinatorial programming to data analysis: seriation using asymmetric proximity measures. Br L Math Statist Psychol 30:154\u2013164","journal-title":"Br L Math Statist Psychol"},{"key":"36_CR15","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF00649265","volume":"2","author":"J Banks","year":"1985","unstructured":"Banks J (1985) Sophisticated voting outcomes and agenda control. Soc Choice Welfare 2:295\u2013306","journal-title":"Soc Choice Welfare"},{"key":"36_CR16","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/BF00183046","volume":"8","author":"J Banks","year":"1991","unstructured":"Banks J, Bordes G, Le Breton M (1991) Covering relations, closest orderings and hamiltonian bypaths in tournaments. Soc Choice Welfare 8:355\u2013363","journal-title":"Soc Choice Welfare"},{"key":"36_CR17","first-page":"47","volume":"17","author":"M Barbut","year":"1966","unstructured":"Barbut M (1966) Note sur les ordres totaux \u00e0 distance minimum d\u2019une relation binaire donn\u00e9e. Math\u00e9matiques et Sciences humaines 17:47\u201348","journal-title":"Math\u00e9matiques et Sciences humaines"},{"issue":"1","key":"36_CR18","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1137\/0403002","volume":"3","author":"A Bar-Noy","year":"1990","unstructured":"Bar-Noy A, Naor J (1990) Sorting, minimal feedback sets, and Hamilton paths in tournaments. SIAM J Disc Math 3(1):7\u201320","journal-title":"SIAM J Disc Math"},{"key":"36_CR19","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0165-4896(81)90041-X","volume":"1","author":"J-P Barth\u00e9lemy","year":"1981","unstructured":"Barth\u00e9lemy J-P, Monjardet B (1981) The median procedure in cluster analysis and social choice theory. Math Soc Sci 1:235\u2013267","journal-title":"Math Soc Sci"},{"key":"36_CR20","unstructured":"Barth\u00e9lemy J-P, Monjardet B (1988) The median procedure in data analysis: new results and open problems. In: Bock HH (ed) Classification and related methods of data analysis. North Holland, Amsterdam"},{"key":"36_CR21","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0377-2217(89)90442-6","volume":"41","author":"J-P Barth\u00e9lemy","year":"1989","unstructured":"Barth\u00e9lemy J-P, Gu\u00e9noche A, Hudry O (1989) Median linear orders: heuristics and a branch and bound algorithm. EJOR 41:313\u2013325","journal-title":"EJOR"},{"key":"36_CR22","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0166-218X(94)00042-C","volume":"60","author":"J-P Barth\u00e9lemy","year":"1995","unstructured":"Barth\u00e9lemy J-P, Hudry O, Isaak G, Roberts FS, Tesman B (1995) The reversing number of a digraph. Discrete Appl Math 60:39\u201376","journal-title":"Discrete Appl Math"},{"key":"36_CR23","volume-title":"Algorithmic Complexity and Communication Problems","author":"J-P Barth\u00e9lemy","year":"1996","unstructured":"Barth\u00e9lemy J-P, Cohen G, Lobstein A (1996) Algorithmic Complexity and Communication Problems. UCL Press, London"},{"key":"36_CR24","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"JJ Bartholdi III","year":"1989","unstructured":"Bartholdi III JJ, Tovey CA, Trick MA (1989) Voting schemes for which it can be difficult to tell who won the election. Soc Choice Welfare 6:157\u2013165","journal-title":"Soc Choice Welfare"},{"key":"36_CR25","unstructured":"Becker O (1967) Das Helmst\u00e4dtersche Reihenfolgeproblem\u2014die Effizienz verschiedener N\u00e4herungsverfahren. In: Computers uses in the Social Science. Vienna"},{"key":"36_CR26","first-page":"37","volume-title":"Metaheuristics: Computer Decision Making","author":"A Belloni","year":"2004","unstructured":"Belloni A, Lucena A (2004) Lagrangian heuristics for the linear ordering problem. In: Resende MGC, de Sousa JP (eds). Metaheuristics: Computer Decision Making. Kluwer Academic Publishers, New York, pp. 37\u201363"},{"key":"36_CR27","unstructured":"Berge C (1985) Graphs. North-Holland, Amsterdam"},{"key":"36_CR28","unstructured":"Berger B, Shor PW (1990) Approximation algorithms for the maximum acyclic subgraph problem. In: Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms (SODA), 236\u2013243"},{"key":"36_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1997.0864","volume":"25","author":"B Berger","year":"1997","unstructured":"Berger B, Shor PW (1997) Tight bounds for the maximum acyclic subgraph problem. J Algor 25:1\u201318","journal-title":"J Algor"},{"key":"36_CR30","first-page":"5","volume":"37","author":"J-C Bermond","year":"1972","unstructured":"Bermond J-C (1972) Ordres \u00e0 distance minimum d\u2019un tournoi et graphes partiels sans circuits maximaux. Math Sci hum 37:5\u201325","journal-title":"Math Sci hum"},{"key":"36_CR31","unstructured":"Bermond J-C (1975) The circuit-hypergraph of a tournament. In: Infinite and finite sets, Proceedings of the Colloquia Mathematica Societatis J\u00e1nos Bolyai 10. North Holland, Amsterdam, 165\u2013180"},{"issue":"3","key":"36_CR32","first-page":"83","volume":"10","author":"J-C Bermond","year":"1976","unstructured":"Bermond J-C, Kodratoff Y (1976) Une heuristique pour le calcul de l\u2019indice de transitivit\u00e9 d\u2019un tournoi. RAIRO 10(3):83\u201392","journal-title":"RAIRO"},{"key":"36_CR33","unstructured":"Bertacco L, Brunetta L, Fischetti M (2004) The linear ordering problem with cumulative costs. Technical report, University of Padova, and EJOR (in press)"},{"key":"36_CR34","volume-title":"The theory of committees and elections","author":"D Black","year":"1958","unstructured":"Black D (1958) The theory of committees and elections. Cambridge University Press, London"},{"key":"36_CR35","doi-asserted-by":"crossref","first-page":"1439","DOI":"10.1287\/mnsc.20.11.1439","volume":"20","author":"JM Blin","year":"1974","unstructured":"Blin JM, Whinston AB (1974) A note on majority rule under transitivity constraints. Manage Sci 20:1439\u20131440","journal-title":"Manage Sci"},{"key":"36_CR36","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1287\/mnsc.21.9.1029","volume":"21","author":"JM Blin","year":"1975","unstructured":"Blin JM, Whinston AB (1975) Discriminant functions and majority voting. Manage Sci 21: 1029\u20131041","journal-title":"Manage Sci"},{"key":"36_CR37","unstructured":"Boenchendorf K (1982) Reihenfolgenprobleme\/Mean-flow-time sequencing. Mathematical Systems in Economics 74, Verlagsgruppe Athan\u00e4um\/Hain\/Scriptor\/Hanstein"},{"issue":"3","key":"36_CR38","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1137\/S0895480196300145","volume":"12","author":"G Bolotashvili","year":"1999","unstructured":"Bolotashvili G, Kovalev M, Girlich E (1999) New Facets of the Linear Ordering Polytope. SIAM J Discrete Math 12(3):326\u2013336","journal-title":"SIAM J Discrete Math"},{"key":"36_CR39","unstructured":"Borda J-C (chevalier de) (1784) M\u00e9moire sur les \u00e9lections au scrutin, Histoire de l\u2019Acad\u00e9mie Royale des Sciences pour 1781, Paris"},{"key":"36_CR40","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1287\/mnsc.19.9.1029","volume":"19","author":"VJ Bowman","year":"1973","unstructured":"Bowman VJ, Colantoni CS (1973) Majority rule under transitivity constraints. Manage Sci 19: 1029\u20131041","journal-title":"Manage Sci"},{"key":"36_CR41","unstructured":"Brualdi RA, Qiao L (1983) Upsets in round robin tournaments. J Combin Theory 35 Ser B:62\u201377"},{"key":"36_CR42","unstructured":"Brualdi RA, Qiao L (1984) The interchange graph of tournaments with the same score vector. In: Progress in graph theory. Academic Press, Toronto, pp 129\u2013151"},{"key":"36_CR43","first-page":"111","volume":"6","author":"VN Burkov","year":"1972","unstructured":"Burkov VN, Groppen VO (1972) Branch cuts in strongly connected graphs and permutation potentials. Auto Remote Control 6:111\u2013119","journal-title":"Auto Remote Control"},{"key":"36_CR44","first-page":"331","volume-title":"New ideas in optimization","author":"V Campos","year":"1999","unstructured":"Campos V, Laguna M, Mart\u00ed R (1999) Scatter search for the linear ordering problem. In: Corne D, Dorigo M, Glover F (eds). New ideas in optimization. McGraw-Hill, New York, pp. 331\u2013339"},{"issue":"4","key":"36_CR45","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1023\/A:1012793906010","volume":"21","author":"V Campos","year":"2001","unstructured":"Campos V, Glover F, Laguna M, Mart\u00ed R (2001) An experimental evaluation of a scatter search for the linear ordering problem. J Global Optim 21(4):397\u2013414","journal-title":"J Global Optim"},{"key":"36_CR46","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF00249646","volume":"6","author":"S Chanas","year":"1996","unstructured":"Chanas S, Kobylanski P (1996) A new heuristic algorithm solving the linear ordering problem. Comput Optim Appl 6:191\u2013205","journal-title":"Comput Optim Appl"},{"key":"36_CR47","unstructured":"Chaovalitwongse W, Pardalos PM (1997) GRASP with Path-Relinking for the Linear Ordering Problem. Industrial and Systems Engineering Working Paper, Rutgers University"},{"issue":"1","key":"36_CR48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0963548306007887","volume":"16","author":"P Charbit","year":"2007","unstructured":"Charbit P, Thomasse S, Yeo A (2007) The minimum feedback arc set problem is NP-hard for tournaments. Combin Prob Comput 16(1):1\u20134","journal-title":"Combin Prob Comput"},{"key":"36_CR49","first-page":"53","volume":"118","author":"I Charon","year":"1992a","unstructured":"Charon I, Germa A, Hudry O (1992a) Encadrement de l\u2019indice de Slater d\u2019un tournoi \u00e0 l\u2019aide de ses scores. Math Inf Sci Hum 118:53\u201368","journal-title":"Math Inf Sci Hum"},{"key":"36_CR50","first-page":"53","volume":"119","author":"I Charon","year":"1992b","unstructured":"Charon I, Germa A, Hudry O (1992b) Utilisation des scores dans des m\u00e9thodes exactes d\u00e9terminant les ordres m\u00e9dians de tournois. Math Inf Sci Hum 119:53\u201374","journal-title":"Math Inf Sci Hum"},{"key":"36_CR51","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/0377-2217(95)00294-4","volume":"95","author":"I Charon","year":"1996a","unstructured":"Charon I, Germa A, Hudry O (1996a) Random generation of tournaments and asymmetric digraphs with given out-degrees. Eur J Oper Res 95:411\u2013419","journal-title":"Eur J Oper Res"},{"key":"36_CR52","doi-asserted-by":"crossref","unstructured":"Charon I, Gu\u00e9noche A, Hudry O, Woirgard F (1996b) A bonsa\u00ef branch and bound method applied to voting theory. In: Ordinal and symbolic data analysis. Springer, Berlin, pp 309\u2013318","DOI":"10.1007\/978-3-642-61159-9_27"},{"key":"36_CR53","first-page":"23","volume":"133","author":"I Charon","year":"1996c","unstructured":"Charon I, Hudry O, Woirgard F (1996c) Ordres m\u00e9dians et ordres de Slater des tournois. Math\u00e9matiques, Informatique et Sciences humaines 133:23\u201356","journal-title":"Math\u00e9matiques, Informatique et Sciences humaines"},{"key":"36_CR54","doi-asserted-by":"crossref","unstructured":"Charon I, Gu\u00e9noche A, Hudry O, Woirgard F (1997a) New results on the computation of median orders. Disc Math 165\u2013166:139\u2013154","DOI":"10.1016\/S0012-365X(96)00166-5"},{"issue":"2\u20133","key":"36_CR55","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0166-218X(97)88689-1","volume":"80","author":"I Charon","year":"1997b","unstructured":"Charon I, Hudry O, Woirgard F (1997b) A 16-vertex tournament for which Banks set and Slater set are disjoint. Disc Appl Math 80(2\u20133):211\u2013215","journal-title":"Disc Appl Math"},{"key":"36_CR56","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1018976217274","volume":"80","author":"I Charon","year":"1998","unstructured":"Charon I, Hudry O (1998) Lamarckian genetic algorithms applied to the aggregation of preferences. Ann Oper Res 80:281\u2013297","journal-title":"Ann Oper Res"},{"key":"36_CR57","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/S1571-0653(05)80125-8","volume":"5","author":"I Charon","year":"2000","unstructured":"Charon I, Hudry O (2000) Slater orders and Hamiltonian paths of tournaments. Electron Notes Disc Math 5:60\u201363","journal-title":"Electron Notes Disc Math"},{"issue":"1","key":"36_CR58","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0377-2217(00)00305-2","volume":"135","author":"I Charon","year":"2001a","unstructured":"Charon I, Hudry O (2001a) The noising methods: a generalization of some metaheuristics. Eur J Oper Res 135(1):86\u2013101","journal-title":"Eur J Oper Res"},{"key":"36_CR59","unstructured":"Charon I, Hudry O (2001b) Metod vetvei i granits dlia recheniia zadatchi o lineinom poriadke na vzvechennikh tournirakh. Discretii Analiz i Issledovanie Operatsii 8 (2) Seriia 2:73\u201391 (in Russian)"},{"key":"36_CR60","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-1-4615-1507-4_12","volume-title":"Essays and surveys in metaheuristics","author":"I Charon","year":"2002","unstructured":"Charon I, Hudry O (2002) The noising methods: a survey. In: Hansen P, Ribeiro CC (eds) Essays and surveys in metaheuristics. Kluwer Academic Publishers, Boston, pp. 245\u2013261"},{"issue":"3","key":"36_CR61","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s00373-002-0510-z","volume":"19","author":"I Charon","year":"2003","unstructured":"Charon I, Hudry O (2003) Links between the Slater index and the Ryser index of tournaments. Graphs Combina 19(3):309\u2013322","journal-title":"Graphs Combina"},{"key":"36_CR62","doi-asserted-by":"crossref","first-page":"2097","DOI":"10.1016\/j.dam.2005.04.020","volume":"154","author":"I Charon","year":"2006","unstructured":"Charon I, Hudry O (2006) A branch and bound algorithm to solve the linear ordering problem for weighted tournaments. Disc Appl Math 154:2097\u20132116","journal-title":"Disc Appl Math"},{"key":"36_CR63","unstructured":"Charon I, Hudry O (2007) Building a mi nimum profile or tournaments or of linear orders from a weighted graph (in preparation)"},{"key":"36_CR64","doi-asserted-by":"crossref","unstructured":"Chartrand G, Geller D, Hedetniemi S (1971) Graphs with forbidden subgraphs. J Comb Theory 10 (1) series B:12\u201341","DOI":"10.1016\/0095-8956(71)90065-7"},{"issue":"1","key":"36_CR65","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02568602","volume":"4","author":"T Christof","year":"1996","unstructured":"Christof T, Reinelt G (1996) Combinatorial optimization and small polytopes. Top 4(1):1\u201364","journal-title":"Top"},{"key":"36_CR66","unstructured":"Christof T, Reinelt G (1997a) Low-dimensional Linear Ordering Polytopes. Working paper, University of Heidelberg"},{"key":"36_CR67","unstructured":"Christof T, Reinelt G (1997b) Small instances relaxations for solving linear ordering problems by branch-and-cut. Technical report, University of Heidelberg"},{"issue":"4","key":"36_CR68","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s00453-001-0029-3","volume":"30","author":"T Christof","year":"2001","unstructured":"Christof T, Reinelt G (2001) Algorithmic aspects of using small instance relaxations in parallel branch-and-cut. Algorithmica 30(4):597\u2013629","journal-title":"Algorithmica"},{"issue":"1","key":"36_CR69","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s11083-004-5129-7","volume":"21","author":"J Christophe","year":"2004","unstructured":"Christophe J, Doignon J-P, Fiorini S (2004) The biorder. Order 21\/1:61\u201382","journal-title":"Order"},{"key":"36_CR70","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1613\/jair.587","volume":"10","author":"W Cohen","year":"1999","unstructured":"Cohen W, Schapire R, Singer Y (1999) Learning to order things. J Artif Intell Res 10:213\u2013270","journal-title":"J Artif Intell Res"},{"key":"36_CR71","unstructured":"Condorcet MJAN, Caritat (marquis de) (1785) Essai sur l\u2019application de l\u2019analyse \u00e0 la probabilit\u00e9 des d\u00e9cisions rendues \u00e0 la pluralit\u00e9 des voix, Paris"},{"key":"36_CR72","unstructured":"Congram RK (2000) Polynomially searchable exponential neighbourhoods for sequencing problems in combinatorial optimisation. PhD thesis, University of Southampton"},{"key":"36_CR73","unstructured":"Conitzer V (2005) Computing Slater Rankings Using Similarities Among Candidates. IBM research report RC23748 (W0510\u2013105)"},{"issue":"3","key":"36_CR74","first-page":"337","volume":"18","author":"WD Cook","year":"1976","unstructured":"Cook WD, Saipe AL (1976) Committee approach to priority planning: the median ranking method. Cahiers du Centre d\u2019\u00e9tudes et de recherche op\u00e8rationnelle 18(3):337\u2013352","journal-title":"Cahiers du Centre d\u2019\u00e9tudes et de recherche op\u00e8rationnelle"},{"issue":"2","key":"36_CR75","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0305-0548(88)90006-8","volume":"15","author":"WD Cook","year":"1988","unstructured":"Cook WD, Golan I, Kress M (1988) Heuristics for ranking players in a round robin tournament. Comput Oper Res 15(2):135\u2013144","journal-title":"Comput Oper Res"},{"issue":"9","key":"36_CR76","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1016\/0305-0548(95)00082-8","volume":"23","author":"WD Cook","year":"1996","unstructured":"Cook WD, Doyle J, Green R, Kress M (1996) Ranking players in multiple tournaments. Comput Oper Res 23(9):869\u2013880","journal-title":"Comput Oper Res"},{"key":"36_CR77","unstructured":"Copeland AH (1951) A \u201creasonable\u201d social welfare function. Seminar on applications of mathematics to social sciences, University of Michigan"},{"key":"36_CR78","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D Coppersmith","year":"1990","unstructured":"Coppersmith D, Winograd S (1990) Matrix multiplication via arithmetic progressions. J Symbolic Comput 9:251\u2013280","journal-title":"J Symbolic Comput"},{"key":"36_CR79","doi-asserted-by":"crossref","unstructured":"Coppersmith D, Fleischer L, Rudra A (2006) Ordering by weighted number of wins gives a good ranking for weighted tournaments. In: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (SODA\u201906), pp 776\u2013782","DOI":"10.1145\/1109557.1109642"},{"issue":"1","key":"36_CR80","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1137\/S0895480197318301","volume":"12","author":"A Czygrinow","year":"1999","unstructured":"Czygrinow A, Poljak S, R\u00f6dl V (1999) Constructive quasi-Ramsey numbers and tournament ranking. SIAM J Disc Math 12(1):48\u201363","journal-title":"SIAM J Disc Math"},{"key":"36_CR81","unstructured":"Davenport A, Kalagnanam J (2004) A computational study of the Kemeny rule for preference aggregation. In: Proceedings of the national conference on artificial intelligence (AAAI), pp 697\u2013702"},{"key":"36_CR82","first-page":"5","volume":"97","author":"B Debord","year":"1987","unstructured":"Debord B (1987a) Caract\u00e9risation des matrices de pr\u00e9f\u00e9rences nettes et m\u00e9thodes d\u2019agr\u00e9gation associ\u00e9es, Math\u00e9matiques et Sciences humaines 97:5\u201317","journal-title":"Caract\u00e9risation des matrices de pr\u00e9f\u00e9rences nettes et m\u00e9thodes d\u2019agr\u00e9gation associ\u00e9es, Math\u00e9matiques et Sciences humaines"},{"key":"36_CR83","unstructured":"Debord B (1987b) Axiomatisation de proc\u00e9dures d\u2019agr\u00e9gation de pr\u00e9f\u00e9rences. PhDthesis, Universit\u00e9 scientifique technologique et m\u00e9dicale de Grenoble"},{"key":"36_CR84","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1093\/biomet\/56.3.537","volume":"3","author":"JS Cani de","year":"1969","unstructured":"de Cani JS (1969) Maximum likelihood paired comparison ranking by linear programming. Biometrika 3:537\u2013545","journal-title":"Biometrika"},{"key":"36_CR85","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1093\/biomet\/59.1.131","volume":"59","author":"JS Cani de","year":"1972","unstructured":"de Cani JS (1972) A branch and bound algorithm for maximum likelihood paired comparison ranking. Biometrika 59:131\u2013135","journal-title":"Biometrika"},{"key":"36_CR86","doi-asserted-by":"crossref","unstructured":"de la Vega, WF (1983) On the maximal cardinality of a consistent set of arcs in a random tournament. J Comb Theory 35, series B:328\u2013332","DOI":"10.1016\/0095-8956(83)90060-6"},{"key":"36_CR87","doi-asserted-by":"crossref","first-page":"503","DOI":"10.4153\/CMB-1967-048-9","volume":"10","author":"JD Dixon","year":"1967","unstructured":"Dixon JD (1967) The maximum order of the group of a tournament. Can Math Bull 10:503\u2013505","journal-title":"Can Math Bull"},{"key":"36_CR88","unstructured":"Dodgson CL (1876) A method of taking votes on more than two issues, Clarendon Press, Oxford, and in D. Black, The theory of committees and elections, Cambridge University Press, London, 1958"},{"issue":"3","key":"36_CR89","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.jmp.2006.01.001","volume":"50","author":"J-P Doignon","year":"2006","unstructured":"Doignon J-P, Fiorini S, Joret G (2006) Facets of the linear ordering polytope: a unification for the fence family through weighted graphs. J Math Psychol 50\/3:251\u2013262","journal-title":"J Math Psychol"},{"key":"36_CR90","doi-asserted-by":"crossref","unstructured":"Dom M, Guo J, H\u00fcffner F, Niedermeier R, Tru\u00df A (2006) Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. Lecture Notes in Computer Science 3998, Springer, Heidelberg, pp 320\u2013331","DOI":"10.1007\/11758471_31"},{"key":"36_CR91","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"RG Downey","year":"1999","unstructured":"Downey RG, Fellows MR (1999) Parameterized complexity. Springer, Berlin"},{"key":"36_CR92","volume-title":"Metaheuristics for hard Optimization, Methods and Case Studies","author":"J Dr\u00e9o","year":"2006","unstructured":"Dr\u00e9o J, Petrowski A, Taillard E, Siarry P (2006) Metaheuristics for hard Optimization, Methods and Case Studies. Springer, Berlin"},{"key":"36_CR93","unstructured":"Duarte A, Laguna M, Marti R (2006) Tabu search for the linear ordering problem with cumulative costs, Technical Report, University of Valencia"},{"key":"36_CR94","unstructured":"Dugat V (1990) D\u00e9composition de tournois r\u00e9guliers : th\u00e9orie et application aux algorithmes de tests d\u2019isomorphisme. PhD thesis, Universit\u00e9 Paul Sabatier, Toulouse"},{"issue":"1988","key":"36_CR95","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0531(88)90096-8","volume":"44","author":"B Dutta","year":"1988","unstructured":"Dutta B (1988) Covering sets and a new Condorcet choice correspondence. J Econ Theory 44(1988):63\u201380","journal-title":"J Econ Theory"},{"key":"36_CR96","doi-asserted-by":"crossref","unstructured":"Dwork C, Kumar R, Naor M, Sivakumar D (2001) Rank aggregation methods for the Web. In: Proceedings of the 10th international conference on World Wide Web (WWW10), pp 613\u2013622","DOI":"10.1145\/371920.372165"},{"key":"36_CR97","first-page":"15","volume":"12","author":"P Eades","year":"1995","unstructured":"Eades P, Lin X (1995) A new heuristic for the feedback arc set problem. Aust J Comb 12:15\u201326","journal-title":"Aust J Comb"},{"issue":"6","key":"36_CR98","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0020-0190(93)90079-O","volume":"47","author":"P Eades","year":"1993","unstructured":"Eades P, Lin X, Smyth WF (1993) A fast and effective heuristic for the feedback arc set problem. Inform Process Lett 47(6):319\u2013323","journal-title":"Inform Process Lett"},{"key":"36_CR99","first-page":"125","volume":"9","author":"P Erd\u00f6s","year":"1964","unstructured":"Erd\u00f6s P, Moser L (1964) On the representation of directed graphs as unions of orderings. Magyar Tud Akad Mat Kutato Int K\u00f6zl 9:125\u2013132","journal-title":"Magyar Tud Akad Mat Kutato Int K\u00f6zl"},{"key":"36_CR100","doi-asserted-by":"crossref","first-page":"269","DOI":"10.4153\/CMB-1965-017-1","volume":"8","author":"P Erd\u00f6s","year":"1965","unstructured":"Erd\u00f6s P, Moon JW (1965) On sets of consistent arcs in a tournament. Canad Math Bull 8:269\u2013271","journal-title":"Canad Math Bull"},{"issue":"2","key":"36_CR101","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/PL00009191","volume":"20","author":"G Even","year":"1998","unstructured":"Even G, Naor JS, Sudan M, Schieber B (1998) Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20(2):151\u2013174","journal-title":"Algorithmica"},{"key":"36_CR102","unstructured":"Fagin R, Kumar R, Mahdian M, Sivakumar D, Vee E (2005) Rank aggregation: an algorithmic perspective. Unpublished Manuscript"},{"key":"36_CR103","doi-asserted-by":"crossref","unstructured":"Festa P, Pardalos P, Resende M (1999) Feedback set problems. In: handbook of combinatorial optimization 4, Kluwer Academic Publishers, Boston","DOI":"10.1007\/978-1-4757-3023-4_4"},{"key":"36_CR104","unstructured":"Fiorini S (2001a) Polyhedral combinatorics of order polytopes. PhD thesis, Universit\u00e9 libre de Bruxelles"},{"issue":"1\u20133","key":"36_CR105","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0166-218X(00)00312-7","volume":"112","author":"S Fiorini","year":"2001b","unstructured":"Fiorini S (2001b) Determining the automorphism group of the linear ordering polytope. Disc Appl Math 112\/1\u20133:121\u2013128","journal-title":"Disc Appl Math"},{"issue":"3","key":"36_CR106","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/S0166-218X(03)00224-5","volume":"131","author":"S Fiorini","year":"2003","unstructured":"Fiorini S, Fishburn P (2003) Facets of linear signed order polytopes. Disc Appl Math 131\/3:597\u2013610","journal-title":"Disc Appl Math"},{"issue":"2","key":"36_CR107","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.disopt.2005.10.007","volume":"3","author":"S Fiorini","year":"2006a","unstructured":"Fiorini S (2006a) How to recycle your facets. Disc Optim 3\/2:136\u2013153","journal-title":"Disc Optim"},{"issue":"4","key":"36_CR108","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1137\/S0895480104440985","volume":"20","author":"S Fiorini","year":"2006b","unstructured":"Fiorini S (2006b) 0, 1\/2-cuts and the linear ordering problem: surfaces that define facets. SIAM J Disc Math 20\/4: 893\u2013912","journal-title":"SIAM J Disc Math"},{"key":"36_CR109","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1137\/0133030","volume":"33","author":"P Fishburn","year":"1977","unstructured":"Fishburn P (1977) Condorcet social choice functions. SIAM J Appl Math 33:469\u2013489","journal-title":"SIAM J Appl Math"},{"key":"36_CR110","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0165-4896(92)90038-7","volume":"23","author":"P Fishburn","year":"1992","unstructured":"Fishburn P (1992) Induced binary probabilities and the linear ordering polytope: a status report. Math Soc Sci 23:67\u201380","journal-title":"Math Soc Sci"},{"key":"36_CR111","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230200102","volume":"20","author":"MM Flood","year":"1990","unstructured":"Flood MM (1990) Exact and heuristic algorithms for the weighted feedback arc set problem: a special case of the skew-symmetric quadratic assignment problem. Networks 20:1\u201323","journal-title":"Networks"},{"issue":"3","key":"36_CR112","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1093\/biomet\/61.3.621","volume":"61","author":"JA Flueck","year":"1974","unstructured":"Flueck JA, Korsh JF (1974) A branch search algorithm for maximum likelihood paired comparison ranking. Biometrika 61(3):621\u2013626","journal-title":"Biometrika"},{"key":"36_CR113","doi-asserted-by":"crossref","first-page":"957","DOI":"10.4153\/CJM-1965-091-7","volume":"17","author":"DR Fulkerson","year":"1965","unstructured":"Fulkerson DR (1965) Upsets in round robin tournaments. Can J Math 17:957\u2013969","journal-title":"Can J Math"},{"key":"36_CR114","unstructured":"Gamboa D, Rego C, Glover F (2006) A Relax-and-Cut RAMP Approach for the Linear Ordering Problem. In the abstracts booklet of ECCOXIX\/CO2006 Joint Meeting, Porto, Portugal, p. 40"},{"issue":"12","key":"36_CR115","doi-asserted-by":"crossref","first-page":"35493565","DOI":"10.1016\/j.cor.2005.03.032","volume":"33","author":"CG Garcia","year":"2006","unstructured":"Garcia CG, Perez-Brito D, Campos V, Marti R (2006) Variable neighborhood search for the linear ordering problem. Comput Oper Res 33(12):35493565","journal-title":"Comput Oper Res"},{"key":"36_CR116","volume-title":"Computers and intractability, a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability, a guide to the theory of NP-completeness. Freeman, New York"},{"key":"36_CR117","unstructured":"Girlich E, Kovalev M, Nalivaiko V (1998) A note on the extension of facet-defining digraphs. Technical report 23\/98, Faculty of Mathematics, University of Magdeburg"},{"key":"36_CR118","doi-asserted-by":"crossref","DOI":"10.1007\/b101874","volume-title":"Handbook of Metaheuristics","author":"F Glover","year":"2003","unstructured":"Glover F, Kochenberger GA (2003) Handbook of Metaheuristics. Kluwer Academic Publishers, Boston"},{"key":"36_CR119","doi-asserted-by":"crossref","first-page":"1190","DOI":"10.1287\/mnsc.20.8.1190","volume":"20","author":"F Glover","year":"1974","unstructured":"Glover F, Klastorin T, Klingman D (1974) Optimal weighted ancestry relationships. Manage Sci 20:1190\u20131193","journal-title":"Manage Sci"},{"issue":"12","key":"36_CR120","doi-asserted-by":"crossref","first-page":"1385","DOI":"10.1287\/mnsc.29.12.1384","volume":"29","author":"ST Goddard","year":"1983","unstructured":"Goddard ST (1983) Tournament rankings. Manage Sci 29(12):1385\u20131392","journal-title":"Manage Sci"},{"key":"36_CR121","doi-asserted-by":"crossref","unstructured":"Goemans MX, Hall LA (1996) The strongest facets of the acyclic subgraph polytope are unknown. In: Cunningham WH, McCormick ST, Queyranne M (eds). Integer programming and optimization, lecture notes in computer science 1084, Springer, Heidelberg, pp 415\u2013429","DOI":"10.1007\/3-540-61310-2_31"},{"key":"36_CR122","unstructured":"Goldberg M (1966) Results on the automorphism group of a graph, M.Sc. Thesis, University of Alberta"},{"key":"36_CR123","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading"},{"key":"36_CR124","unstructured":"Gonz\u00e1lez CG, P\u00e9rez-Brito D (2001) A variable neighborhood search for solving the linear ordering problem. In: Proceedings of MIC\u20192001\u20134th Metaheuristics International Conference, pp 181\u2013185"},{"key":"36_CR125","unstructured":"Grindberg E, Dambit Y (1965) Some properties of graphs containing circuits. Latv math ezh 65\u201370 (in Russian)"},{"key":"36_CR126","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M Gr\u00f6tschel","year":"1984a","unstructured":"Gr\u00f6tschel M, J\u00fcnger M, Reinelt G (1984a) A cutting plane algorithm for the linear ordering problem. Oper Res 32:1195\u20131220","journal-title":"Oper Res"},{"key":"36_CR127","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02932410","volume":"25","author":"M Gr\u00f6tschel","year":"1984b","unstructured":"Gr\u00f6tschel M, J\u00fcnger M, Reinelt G (1984b) Optimal triangulation of large real-world input-output-matrices. Statistische Hefte 25:261\u2013295","journal-title":"Statistische Hefte"},{"key":"36_CR128","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01582008","volume":"33","author":"M Gr\u00f6tschel","year":"1985a","unstructured":"Gr\u00f6tschel M, J\u00fcnger M, Reinelt G (1985a) On the acyclic subgraph polytope. Math Program 33:1\u201327","journal-title":"Math Program"},{"key":"36_CR129","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01582010","volume":"33","author":"M Gr\u00f6tschel","year":"1985b","unstructured":"Gr\u00f6tschel M, J\u00fcnger M, Reinelt G (1985b) Facets of the linear ordering polytope. Math Program 33:43\u201360","journal-title":"Math Program"},{"key":"36_CR130","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel M, J\u00fcnger M, Reinelt G (1985c) Acyclic subdigraphs and linear orderings: polytopes, facets, and a cutting plane algorithm. In: Rival I (ed) Graphs and orders. D Reidel Publishing Company 217\u2013264","DOI":"10.1007\/978-94-009-5315-4_7"},{"issue":"1","key":"36_CR131","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1051\/ro\/1977110100771","volume":"11","author":"A Gu\u00e9noche","year":"1977","unstructured":"Gu\u00e9noche A (1977) Un algorithme pour pallier l\u2019effet Condorcet. RAIRO 11(1):77\u201383","journal-title":"RAIRO"},{"key":"36_CR132","unstructured":"Gu\u00e9noche A (1986) A. B. C. D. : logiciel d\u2019analyses bool\u00e9ennes et combinatoires des donn\u00e9es, notice d\u2019utilisation. G. R. T. C, Marseille"},{"key":"36_CR133","unstructured":"Gu\u00e9noche A (1988) Order at minimum distance of a valued tournament. Communication to Mod\u00e9lisation, Analyse et Agr\u00e9gation des Pr\u00e9f\u00e9rences et des Choix (TRAP 3), Marseille-Luminy"},{"key":"36_CR134","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1051\/agro:19940602","volume":"14","author":"A Gu\u00e9noche","year":"1994","unstructured":"Gu\u00e9noche A, Vandeputte-Riboud B, Denis J-B (1994) Selecting varieties using a series of trials and a combinatorial ordering method. Agronomie 14:363\u2013375","journal-title":"Agronomie"},{"key":"36_CR135","first-page":"611","volume-title":"Advances in intelligent computing. IPMU\u201994, Lecture notes in computer sciences 945","author":"A Gu\u00e9noche","year":"1995","unstructured":"Gu\u00e9noche A (1995) How to choose according to partial evaluations. In: Bouchon-Meunier B, et\u00a0al. (eds) Advances in intelligent computing, IPMU\u201994. Lecture notes in computer sciences 945. Springer, Heidelberg, pp. 611\u2013618"},{"key":"36_CR136","first-page":"57","volume":"133","author":"A Gu\u00e9noche","year":"1996","unstructured":"Gu\u00e9noche A (1996) Vainqueurs de Kemeny et tournois difficiles. Math Inf Sci Hum 133:57\u201366","journal-title":"Math Inf Sci Hum"},{"key":"36_CR137","doi-asserted-by":"crossref","unstructured":"Guilbaud GT (1952) Les th\u00e9ories de l\u2019int\u00e9r\u00eat g\u00e9n\u00e9ral et le probl\u00e8me logique de l\u2019agr\u00e9gation. \u00e9conomie appliqu\u00e9e 5 (4), reprint in \u00e9l\u00e9ments de la th\u00e9orie des jeux, Dunod, Paris, 1968","DOI":"10.3406\/ecoap.1952.3831"},{"key":"36_CR138","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/S0021-9800(67)80014-0","volume":"3","author":"RK Guy","year":"1967","unstructured":"Guy RK (1967) A coarseness conjecture of Erd\u00f6s. J Comb Theory 3:38\u201342","journal-title":"J Comb Theory"},{"key":"36_CR139","first-page":"35","volume":"51","author":"J Hardouin Duparc","year":"1975","unstructured":"Hardouin Duparc J (1975) Quelques r\u00e9sultats sur l\u2019 <\u00a0<\u00a0indice de transitivit\u00e9\u00a0>\u00a0> de certains tournois. Math\u00e9matiques et Sciences humaines 51:35\u201341","journal-title":"Math\u00e9matiques et Sciences humaines"},{"issue":"3","key":"36_CR140","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(94)00086-7","volume":"51","author":"R Hassin","year":"1994","unstructured":"Hassin R, Rubinstein S (1994) Approximations for the maximum acyclic subgraph problem. Inform Process Lett 51(3):133\u2013140","journal-title":"Inform Process Lett"},{"key":"36_CR141","doi-asserted-by":"crossref","unstructured":"Huang G, Lim A (2003) Designing a hybrid genetic algorithm for the linear ordering problem. In: Proceedings of \u201cGenetic and Evolutionary Computation Conference (GECCO) 2003\u201d, part I. Springer, Heidelberg LNCS 2723, pp 1053\u20131064","DOI":"10.1007\/3-540-45105-6_115"},{"key":"36_CR142","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1111\/j.2044-8317.1976.tb00701.x","volume":"29","author":"L Huber","year":"1976","unstructured":"Huber L (1976) Seriation using asymmetric proximity measures. Br J Math Statist Psychol 29:32\u201352","journal-title":"Br J Math Statist Psychol"},{"issue":"3","key":"36_CR143","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1093\/biomet\/62.3.655","volume":"62","author":"L Hubert","year":"1975","unstructured":"Hubert L, Schulz J (1975) Maximum likehood paired-comparison ranking and quadratic assignment. Biometrika 62(3):655\u2013659","journal-title":"Biometrika"},{"key":"36_CR144","unstructured":"Hudry O (1989) Recherche d\u2019ordres m\u00e9dians : complexit\u00e9, algorithmique et probl\u00e8mes combinatoires. PhD thesis, ENST, Paris"},{"key":"36_CR145","unstructured":"Hudry O (1997a) Algorithms for the aggregation of ordinal preferences: a review. In: Proceedings of the first conference on operations and quantitative management (ICOQM), pp 169\u2013176"},{"key":"36_CR146","first-page":"51","volume":"140","author":"O Hudry","year":"1997b","unstructured":"Hudry O (1997b) Nombre maximum d\u2019ordres de Slater des tournois T v\u00e9rifiant \u03c3(T)\u00a0=\u00a01. Math\u00e9matiques, Informatique et Sciences humaines 140:51\u201358","journal-title":"Math\u00e9matiques, Informatique et Sciences humaines"},{"key":"36_CR147","unstructured":"Hudry O (1998) Tournois et optimisation combinatoire. Habilitation \u00e0 diriger des recherches, Universit\u00e9 Paris 6, Paris, 1998"},{"key":"36_CR148","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s00355-003-0241-y","volume":"23","author":"O Hudry","year":"2004","unstructured":"Hudry O (2004) A note on \u201cBanks winners in tournaments are difficult to recognize\u201d by G.J. Woeginger. Soc Choice Welfare 23:113\u2013114","journal-title":"Soc Choice Welfare"},{"key":"36_CR149","unstructured":"Hudry O (2006) On the difficulty of computing the winners of a tournament. Annales du LAMSADE 6, In: Proceedings of the workshop on voting theory and preference modelling, DIMACS, 2006, pp 181\u2013191"},{"key":"36_CR150","doi-asserted-by":"crossref","unstructured":"Hudry O (2007) Complexity results on the aggregation of linear orders into median orders. Ann Oper Res (in press)","DOI":"10.1007\/s10479-008-0353-y"},{"key":"36_CR151","unstructured":"Hudry O (2007) Complexity of Slater problems (in preparation)"},{"key":"36_CR152","doi-asserted-by":"crossref","unstructured":"Isaak G (1995) Tournaments as feedback arc sets. Electron J Comb 2:R20","DOI":"10.37236\/1214"},{"key":"36_CR153","first-page":"115","volume":"83","author":"G Isaak","year":"1991","unstructured":"Isaak G, Tesman B (1991) The weighted reversing number of a digraph. Congressus Numerantium 83:115\u2013124","journal-title":"Congressus Numerantium"},{"key":"36_CR154","first-page":"1","volume":"4","author":"\u00c9 Jacquet-Lagr\u00e8ze","year":"1969","unstructured":"Jacquet-Lagr\u00e8ze \u00c9 (1969) L\u2019agr\u00e9gation des opinions individuelles. Informatique et Sciences humaines 4:1\u201321","journal-title":"Informatique et Sciences humaines"},{"key":"36_CR155","unstructured":"Jung H.A (1970) On subgraphs without cycles in a tournament. In: P. Erd\u00f6s, A. Renyi, V.T. S\u00f6s (eds) Combinatorial theory and its applications II, North-Holland, Amsterdam, pp 675\u2013677"},{"key":"36_CR156","volume-title":"Polyhedral combinatorics and the acyclic subdigraph problem","author":"M J\u00fcnger","year":"1985","unstructured":"J\u00fcnger M (1985) Polyhedral combinatorics and the acyclic subdigraph problem. Heldermann Verlag, Berlin"},{"key":"36_CR157","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0377-2217(81)90005-9","volume":"8","author":"R Kaas","year":"1981","unstructured":"Kaas R (1981) A branch and bound algorithm for the acyclic subgraph problem. Eur J Oper Res 8:355\u2013362","journal-title":"Eur J Oper Res"},{"key":"36_CR158","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1214\/aoms\/1177699532","volume":"37","author":"JB Kadane","year":"1966","unstructured":"Kadane JB (1966) Some equivalence classes in paired comparisons. Ann Math Statist 37:488\u2013494","journal-title":"Ann Math Statist"},{"issue":"1","key":"36_CR159","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1137\/0606009","volume":"6","author":"M Kano","year":"1985","unstructured":"Kano M, Sakamoto A (1985) Ranking the vertices of a paired comparison digraph. SIAM J Alg Disc Meth 6(1):79\u201392","journal-title":"SIAM J Alg Disc Meth"},{"key":"36_CR160","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"R Karp","year":"1972","unstructured":"Karp R (1972) Reducibility among combinatorial problems. In: Miller RE, Tatcher JW (eds). Complexity of computer computations. Plenum Press, New York, pp. 85\u2013103"},{"issue":"2","key":"36_CR161","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0305-0548(94)E0024-2","volume":"22","author":"M Kaykobad","year":"1995","unstructured":"Kaykobad M, Ahmed QNU, Shafiqul Khalid ATM, Bakhtiar R-A (1995) A new algorithm for ranking players of a round-robin tournament. Comput Oper Res 22(2):221\u2013226","journal-title":"Comput Oper Res"},{"key":"36_CR162","first-page":"577","volume":"88","author":"JG Kemeny","year":"1959","unstructured":"Kemeny JG (1959) Mathematics without numbers. Daedalus 88:577\u2013591","journal-title":"Daedalus"},{"key":"36_CR163","volume-title":"Rank correlation methods","author":"MG Kendall","year":"1938","unstructured":"Kendall MG (1938) Rank correlation methods. Hafner, New York"},{"key":"36_CR164","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1093\/biomet\/33.3.239","volume":"33","author":"MG Kendall","year":"1940","unstructured":"Kendall MG, Babington Smith B (1940) On the method of paired comparisons. Biometrika 33: 239\u2013251","journal-title":"Biometrika"},{"issue":"35","key":"36_CR165","first-page":"1","volume":"4","author":"C Klamler","year":"2003","unstructured":"Klamler C (2003) Kemeny\u2019s rule and Slater\u2019s rule: a binary comparison. Econ Bull 4(35):1\u20137","journal-title":"Econ Bull"},{"key":"36_CR166","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s00355-003-0238-6","volume":"23","author":"C Klamler","year":"2004","unstructured":"Klamler C (2004) The Dodgson ranking and its relation to Kemeny\u2019s method and Slater\u2019s rule. Soc Choice Welfare 23:91\u2013102","journal-title":"Soc Choice Welfare"},{"key":"36_CR167","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1006\/jmps.1995.1003","volume":"19","author":"M Koppen","year":"1995","unstructured":"Koppen M (1995) Random utility representation of binary choice probabilities: critical graphs yielding critical necessary conditions. J Math Psych 19:21\u201339","journal-title":"J Math Psych"},{"key":"36_CR168","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0167-5060(08)70820-3","volume":"4","author":"B Korte","year":"1979","unstructured":"Korte B (1979) Approximation algorithms for discrete optimization problems. Ann Disc Math 4:85\u2013120","journal-title":"Ann Disc Math"},{"key":"36_CR169","first-page":"217","volume":"12","author":"B Korte","year":"1968","unstructured":"Korte B, Oberhofer W (1968) Zwei Algorithmen zur L\u00f6sung eines komplexen Reihenfolgeproblems. Unternehmensforschung 12:217\u2013231","journal-title":"Unternehmensforschung"},{"key":"36_CR170","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1515\/jbnst-1968-0125","volume":"182","author":"B Korte","year":"1969","unstructured":"Korte B, Oberhofer W (1969) Zur Triangulation von Input-Output-Matrizen. Jahrbuch Nationaloekon Statist 182:398\u2013433","journal-title":"Jahrbuch Nationaloekon Statist"},{"key":"36_CR171","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0012-365X(75)90092-8","volume":"12","author":"Kotzig","year":"1975","unstructured":"Kotzig, A (1975) On the maximal order of cyclicity of antisymmetric directed graphs. Disc Math 12:17\u201325","journal-title":"Disc Math"},{"key":"36_CR172","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/BF00183047","volume":"8","author":"G Laffond","year":"1991","unstructured":"Laffond G, Laslier J-F (1991) Slater\u2019s winners of a tournament may not be in the Banks set. Soc Choice Welfare 8:355\u2013363","journal-title":"Soc Choice Welfare"},{"key":"36_CR173","unstructured":"Laffond G, Laslier J-F, Le Breton M (1991a) Choosing from a tournament: a progress report and some new results. Technical report, CNAM, Paris"},{"key":"36_CR174","unstructured":"Laffond G, Laslier J-F, Le Breton M (1991b) A game-theoretical method for ranking the participants in a tournament\u201d, Technical report, CNAM, Paris"},{"key":"36_CR175","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1006\/game.1993.1010","volume":"5","author":"G Laffond","year":"1993","unstructured":"Laffond G, Laslier J-F, Le Breton M (1993) The Bipartisan set of a tournament game. Games Econ Behav 5:182\u2013201","journal-title":"Games Econ Behav"},{"key":"36_CR176","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02478336","volume":"13","author":"HG Landau","year":"1953","unstructured":"Landau HG (1953) On dominance relations and the structure of animal societies III. The condition for a score structure. Bull Math Biophys 13:1\u201319","journal-title":"The condition for a score structure. Bull Math Biophys"},{"issue":"12","key":"36_CR177","doi-asserted-by":"crossref","first-page":"1217","DOI":"10.1016\/S0305-0548(98)00104-X","volume":"26","author":"M Laguna","year":"1999","unstructured":"Laguna M, Marti R, Campos V (1999) Intensification and diversification with elite tabu search solutions for the linear ordering problem. Comput Oper Res 26(12):1217\u20131230","journal-title":"Comput Oper Res"},{"key":"36_CR178","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-60805-6","volume-title":"Tournament solutions and majority voting","author":"J-F Laslier","year":"1997","unstructured":"Laslier J-F (1997) Tournament solutions and majority voting. Springer, Heidelberg"},{"key":"36_CR179","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1109\/TCT.1964.1082291","volume":"11","author":"EL Lawler","year":"1964","unstructured":"Lawler EL (1964) A comment on minimum feedback arc sets. IEEE Trans Circuit Theory 11:296\u2013297","journal-title":"IEEE Trans Circuit Theory"},{"key":"36_CR180","doi-asserted-by":"crossref","unstructured":"Leighton T, Rao S (1988) An approximation max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In: Proceedings of the 29th annual symposium on foundations of computer science, pp 422\u2013431","DOI":"10.1109\/SFCS.1988.21958"},{"key":"36_CR181","doi-asserted-by":"crossref","unstructured":"Lemar\u00e9chal C (2003) The omnipresence of Lagrange, 4OR 1(1):7\u201325","DOI":"10.1007\/s10288-002-0003-1"},{"key":"36_CR182","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/TCT.1966.1082620","volume":"13","author":"A Lempel","year":"1966","unstructured":"Lempel A, Cederbaum I (1966) Minimum feedback arc and vertex sets of a directed graph. I E E E Trans Circuit Theory 13:399\u2013403","journal-title":"I E E E Trans Circuit Theory"},{"key":"36_CR183","unstructured":"Lenstra HW Jr (1973) The acyclic subgraph problem. Technical report BW26, Mathematisch Centrum, Amsterdam"},{"key":"36_CR184","unstructured":"Lenstra JK (1977) Sequencing by enumerative methods. Mathematical Centre Tracts 69, Mathematisch Centrum, Amsterdam"},{"key":"36_CR185","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0166-218X(92)00151-B","volume":"50","author":"J Leung","year":"1994","unstructured":"Leung J, Lee J (1994) More facets from fences for linear ordering and acyclic subgraph polytopes. Disc Appl Mathe 50:185\u2013200","journal-title":"Disc Appl Mathe"},{"key":"36_CR186","unstructured":"Loiseau I, Mendez-Dias I, Nasini G (1993) Determinacion del rango disyuntivo de facetas del problema de ordinacion lineal. Anales XXII JAIIO, pp 124\u2013130"},{"key":"36_CR187","unstructured":"Marcotorchino J-F, Michaud P (1979) Optimisation en analyse ordinale de donn\u00e9es, Masson, Paris"},{"key":"36_CR188","unstructured":"Matousek J, Nesetril J (1998) Invitation to Discrete Mathematics, Clarendon Press, Oxford University Press, New York"},{"key":"36_CR189","doi-asserted-by":"crossref","first-page":"608","DOI":"10.2307\/1907926","volume":"21","author":"D McGarvey","year":"1953","unstructured":"McGarvey D (1953) A theorem on the construction of voting paradoxes. Econometrica 21:608\u2013610","journal-title":"Econometrica"},{"key":"36_CR190","unstructured":"McKey B (2006) http:\/\/cs.anu.edu.au\/~bdm\/data\/digraphs.html"},{"key":"36_CR191","doi-asserted-by":"crossref","unstructured":"McLean I, Urken A (1995) Classics of social choice, University of Michigan Press","DOI":"10.3998\/mpub.12736"},{"key":"36_CR192","unstructured":"M\u00e9ndez-D\u00edaz I, Nasini G, Zabala P (submitted for publication) The disjunctive rank and cutting plane algorithms using of facets of the linear ordering polytope"},{"key":"36_CR193","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/S0377-2217(99)00110-1","volume":"123","author":"D Mendon\u00e7a","year":"2000","unstructured":"Mendon\u00e7a D, Raghavachari M (2000) Comparing the efficacy of ranking methods for multiple round-robin tournaments. Eur J Oper Res 123:593\u2013605","journal-title":"Eur J Oper Res"},{"issue":"2","key":"36_CR194","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1287\/mnsc.23.2.125","volume":"23","author":"DK Merchant","year":"1976","unstructured":"Merchant DK, Rao MR (1976) Majority decisions and transitivity: some special cases. Manage Sci 23(2):125\u2013130","journal-title":"Manage Sci"},{"issue":"1","key":"36_CR195","doi-asserted-by":"crossref","first-page":"68","DOI":"10.2307\/2110925","volume":"24","author":"N Miller","year":"1980","unstructured":"Miller N (1980) A new solution set for tournaments and majority voting: Further graph-theoretical approaches to the theory of voting. Am J Polit Sci 24(1):68\u201396","journal-title":"Am J Polit Sci"},{"key":"36_CR196","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF02206819","volume":"62","author":"JE Mitchell","year":"1996","unstructured":"Mitchell JE, Borchers B (1996) Solving real world linear ordering problems using a primal-dual interior point cutting plane method. Ann Oper Res 62:253\u2013276","journal-title":"Ann Oper Res"},{"key":"36_CR197","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/978-1-4757-3216-0_14","volume-title":"High Performance Optimization","author":"JE Mitchell","year":"2000","unstructured":"Mitchell JE, Borchers B (2000) Solving linear ordering problems with a combined interior point\/ simplex cutting plane algorithm. In: Frenk HL, Roos K, Terlaky T, Zhang S (eds). High Performance Optimization. Kluwer Academic Publishers, Dordrecht, pp. 349\u2013366"},{"key":"36_CR198","unstructured":"Mitchell J (2007) Generating linear ordering problems, http:\/\/www.rpi.edu\/~mitchj\/generators\/ linord\/"},{"key":"36_CR199","first-page":"55","volume":"43","author":"B Monjardet","year":"1973","unstructured":"Monjardet B (1973) Tournois et ordres m\u00e9dians pour une opinion, Math\u00e9matiques et Sciences humaines 43:55\u201373","journal-title":"Tournois et ordres m\u00e9dians pour une opinion, Math\u00e9matiques et Sciences humaines"},{"key":"36_CR200","first-page":"115","volume":"67","author":"B Monjardet","year":"1979","unstructured":"Monjardet B (1979) Relations \u00e0 \u00e9loignement minimum de relations binaires, note bibliographique. Math\u00e9matiques et Sciences humaines 67:115\u2013122","journal-title":"Math\u00e9matiques et Sciences humaines"},{"key":"36_CR201","first-page":"61","volume":"111","author":"B Monjardet","year":"1990","unstructured":"Monjardet B (1990) Sur diverses formes de la \u201cr\u00e8gle de Condorcet\u201d d\u2019agr\u00e9gation des pr\u00e9f\u00e9rences. Math Inf Sci hum 111:61\u201371","journal-title":"Math Inf Sci hum"},{"key":"36_CR202","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0165-4896(97)00010-3","volume":"34","author":"H Monsuur","year":"1997","unstructured":"Monsuur H, Storcken T (1997) Measuring intransitivity. Math Soc Sci 34:125\u2013152","journal-title":"Math Soc Sci"},{"key":"36_CR203","unstructured":"Moon JW (1968) Topics on tournaments, Holt, Rinehart and Winston"},{"key":"36_CR204","unstructured":"Nalivaiko V (1997) The linear ordering polytope. Preprint 39\/97, Faculty of Mathematics of the Otto-von-Guericke-University of Magdeburg"},{"key":"36_CR205","unstructured":"Nishihara O, Kumamoto H, Inoue K (1989) The new formulations of minimum feedback arc set problem. In: Brexinski C (ed) Numerical and applied mathematics. J.C. Baltzer AG, Scientific Publishing Co"},{"key":"36_CR206","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0166-218X(94)00060-Q","volume":"60","author":"Z Nutov","year":"1995","unstructured":"Nutov Z, Penn M (1995) On the integral dicycle packings and covers and the linear ordering polytope. Disc Appl Math 60:293\u2013309","journal-title":"Disc Appl Math"},{"key":"36_CR207","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0024-3795(94)00063-8","volume":"233","author":"Z Nutov","year":"1996","unstructured":"Nutov Z, Penn M (1996) On non (0,1\/2,1) Extreme Points of the Generalized Transitive Tournament Polytope. Linear Algebra and its applications 233:149\u2013159","journal-title":"Linear Algebra and its applications"},{"key":"36_CR208","unstructured":"Orlin JB (1981) unpublished manuscript"},{"key":"36_CR209","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C Papadimitriou","year":"1991","unstructured":"Papadimitriou C, Yannakakis M (1991) Optimization, approximation, and complexity classes. J Comput Syst Sci 43:425\u2013440","journal-title":"J Comput Syst Sci"},{"key":"36_CR210","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1111\/j.2044-8317.1967.tb00388.x","volume":"20","author":"JPN Phillips","year":"1967","unstructured":"Phillips JPN (1967) A procedure for determining Slater\u2019s i and all nearest adjoining orders. British Journal of Mathematical and Statistical Psychology 20:217\u2013225","journal-title":"British Journal of Mathematical and Statistical Psychology"},{"key":"36_CR211","doi-asserted-by":"crossref","unstructured":"Phillips JPN (1969) A further procedure for determining Slater\u2019s i and all nearest adjoining orders. Br J Math Stat Psychol 22:97101","DOI":"10.1111\/j.2044-8317.1969.tb00422.x"},{"key":"36_CR212","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1111\/j.2044-8317.1976.tb00709.x","volume":"29","author":"JPN Phillips","year":"1976","unstructured":"Phillips JPN (1976) On an algorithm of Smith and Payne for determining Slater\u2019s i and all nearest adjoining orders. Br J Math Stat Psychol 29:126\u2013127","journal-title":"Br J Math Stat Psychol"},{"key":"36_CR213","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0012-365X(86)90192-5","volume":"58","author":"S Poljak","year":"1986","unstructured":"Poljak S, Turz\u00edk D (1986) A polynomial time heuristic for certain subgraph optimization problems with guaranteed lower bound. Disc Math 58:99\u2013104","journal-title":"Disc Math"},{"issue":"3","key":"36_CR214","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1137\/0401037","volume":"1","author":"S Poljak","year":"1988","unstructured":"Poljak S, R\u00f6dl V, Spencer J (1988) Tournament ranking with expected profit in polynomial time. SIAM J Disc Math 1(3):372\u2013376","journal-title":"SIAM J Disc Math"},{"key":"36_CR215","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1016\/j.tcs.2005.10.010","volume":"351","author":"V Raman","year":"2006","unstructured":"Raman V, Saurabh S (2006) Parameterized algorithms for feedback set problems and their duals in tournaments. Theor Comput Sci 351:446\u2013458","journal-title":"Theor Comput Sci"},{"key":"36_CR216","first-page":"39","volume":"7","author":"L R\u00e9dei","year":"1934","unstructured":"R\u00e9dei L (1934) Ein kombinatorischer Satz. Acta Litt Szeged 7:39\u201343","journal-title":"Acta Litt Szeged"},{"key":"36_CR217","doi-asserted-by":"crossref","first-page":"261","DOI":"10.4153\/CMB-1969-032-x","volume":"12","author":"KB Reid","year":"1969","unstructured":"Reid KB (1969) On set of arcs containing no cycles in tournaments. Canad. Math Bull 12:261\u2013264","journal-title":"Canad. Math Bull"},{"key":"36_CR218","unstructured":"Reid KB (1983) Monochromatic reachability, complementary cycles and single arc reversals in tournaments. In: Graph Theory, Proceedings of the First Southeast Asian Graph Theory Colloquium held in Singapore (May 1983). Springer, Lecture Notes in Mathematics 1073, Berlin, pp 11\u201321"},{"key":"36_CR219","first-page":"156","volume-title":"Handbook of Graph Theory","author":"KB Reid","year":"2004","unstructured":"Reid KB (2004) Tournaments. In: Gross JL, Yellen J (eds). Handbook of Graph Theory. CRC Press, Boca Raton, pp. 156\u2013184"},{"key":"36_CR220","first-page":"169","volume-title":"Selected topics in graph theory","author":"KB Reid","year":"1978","unstructured":"Reid KB, Beineke LW (1978) Tournaments. In: Beineke LW, Wilson RJ (eds). Selected topics in graph theory. Academic, New York, pp. 169\u2013204"},{"key":"36_CR221","unstructured":"Reinelt G (1985) The linear ordering problem: algorithms and applications. Research and Exposition in Mathematics 8, Heldermann Verlag, Berlin"},{"key":"36_CR222","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02573963","volume":"10","author":"G Reinelt","year":"1993","unstructured":"Reinelt G (1993) A Note on Small Linear-Ordering Polytopes. Disc Comput Geometry 10:67\u201378","journal-title":"Disc Comput Geometry"},{"key":"36_CR223","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1214\/aoms\/1177703572","volume":"35","author":"R Remage","year":"1964","unstructured":"Remage R, Thompson WA (1964) Rankings from paired comparison. Ann math Statist 35:739\u2013747","journal-title":"Ann math Statist"},{"key":"36_CR224","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1093\/biomet\/53.1-2.143","volume":"53","author":"R Remage","year":"1966","unstructured":"Remage R, Thompson WA (1966) Maximum likelihood paired comparison rankings. Biometrika 53:143\u2013149","journal-title":"Biometrika"},{"key":"36_CR225","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1137\/0138009","volume":"98","author":"A Rubinstein","year":"1980","unstructured":"Rubinstein A (1980) Ranking the participants in a tournament. SIAM J Appl Math 98:108\u201311","journal-title":"SIAM J Appl Math"},{"key":"36_CR226","unstructured":"Ryser HJ (1964) Matrices of zeros and ones in combinatorial mathematics. In: Recent advances in matrix theory, University of Wisconsin Press, Madison, pp 103\u2013124"},{"key":"36_CR227","first-page":"322","volume-title":"Applications of evolutionary computing. Lecture notes in computer science 2611","author":"T Schiavinotto","year":"2003","unstructured":"Schiavinotto T, St\u00fctzle T (2003) Search space analysis of the linear ordering problem. In: Raidl GR et\u00a0al. (eds). Applications of evolutionary computing. Lecture notes in computer science 2611. Springer, Berlin, pp. 322\u2013333"},{"issue":"4","key":"36_CR228","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1023\/B:JMMA.0000049426.06305.d8","volume":"3","author":"T Schiavinotto","year":"2004","unstructured":"Schiavinotto T, St\u00fctzle T (2004) The linear ordering problem: instances, search space analysis and algorithms. J Math Model Algorithms 3(4):367\u2013402","journal-title":"J Math Model Algorithms"},{"key":"36_CR229","volume-title":"Combinatorial optimization. Polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization. Polyhedra and efficiency. Springer, Berlin"},{"key":"36_CR230","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01832917","volume":"7","author":"T Schwartz","year":"1990","unstructured":"Schwartz T (1990) Cyclic tournaments and cooperative majority voting: a solution. Soc Choice Welfare 7:19\u201329","journal-title":"Soc Choice Welfare"},{"issue":"2","key":"36_CR231","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF01200760","volume":"15","author":"P Seymour","year":"1995","unstructured":"Seymour P (1995) Packing directed circuits fractionally. Combinatorica 15(2):281\u2013288","journal-title":"Combinatorica"},{"key":"36_CR232","doi-asserted-by":"crossref","first-page":"303312","DOI":"10.1093\/biomet\/48.3-4.303","volume":"48","author":"P Slater","year":"1961","unstructured":"Slater P (1961) Inconsistencies in a schedule of paired comparisons. Biometrika 48:303312","journal-title":"Biometrika"},{"key":"36_CR233","unstructured":"Smith WD (2007) http:\/\/rangevoting.org\/PuzzDG.html"},{"key":"36_CR234","doi-asserted-by":"crossref","unstructured":"Smith AFM, Payne CD (1974) An algorithm for determining Slater\u2019s i and all nearest adjoining orders. Br J Math Stat Psychol 27:4952","DOI":"10.1111\/j.2044-8317.1974.tb00526.x"},{"key":"36_CR235","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/net.3230010204","volume":"1","author":"J Spencer","year":"1971","unstructured":"Spencer J (1971) Optimal ranking of tournaments. Networks 1:135\u2013138","journal-title":"Networks"},{"key":"36_CR236","first-page":"142","volume-title":"Studies in combinatorics","author":"J Spencer","year":"1978","unstructured":"Spencer J (1978) Nonconstructive methods in discrete mathematics. In: Rota GC (eds). Studies in combinatorics. Mathematical Association of America, Washington DC, pp. 142\u2013178"},{"key":"36_CR237","unstructured":"Spencer J (1987) Ten lectures on the probabilistic method. CBMS-NSF regional conference series in applied mathematics N\u00b0 52, SIAM, Philadelphy"},{"key":"36_CR238","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1080\/00029890.1959.11989405","volume":"66","author":"R Stearns","year":"1959","unstructured":"Stearns R (1959) The voting problem. Am Math Monthly 66:761\u2013763","journal-title":"Am Math Monthly"},{"key":"36_CR239","unstructured":"Szele T (1943) Kombinatorikai vizsg\u00e1latok az ir\u00e1ny\u00edtott teljes gr\u00e1ffal kapesolatban. Mat Fiz Lapok 50:223\u2013256, German translation: Untersuchungen \u00fcber gerichtete vollst\u00e4ndige Graphen. Publ Math Debrecen 13(1966):145\u2013168"},{"key":"36_CR240","first-page":"43","volume":"51","author":"C Thomassen","year":"1975","unstructured":"Thomassen C (1975) Transversals of circuits in the lexicographic product of directed graphs. Math\u00e9matiques et Sciences Humaines 51:43\u201345","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"issue":"series B","key":"36_CR241","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0095-8956(87)90068-2","volume":"42","author":"C Thomassen","year":"1987","unstructured":"Thomassen C (1987) Counterexamples to Ad\u00e1m\u2019s conjecture on arc reversals in directed graphs. J Comb Theory 42, series B:128\u2013130","journal-title":"J Comb Theory"},{"key":"36_CR242","unstructured":"Tucker AW (1960) On directed graphs and integer programs. In: 1960 symposium on combinatorial problems, Princeton University, Princeton"},{"key":"36_CR243","unstructured":"T\u00fcshaus U (1983) Aggregation bin\u00e4rer Relationen in der qualitativen Datenanalyse. Mathematical Systems in Economics 82, Verlagsgruppe Athen\u00e4um\/Hain\/Hanstein"},{"key":"36_CR244","unstructured":"van Zuylen A (2005) Deterministic approximation algorithms for ranking and clusterings. Cornell ORIE Tech. Report No. 1431"},{"key":"36_CR245","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation algorithms","author":"VV Vazirani","year":"2003","unstructured":"Vazirani VV (2003) Approximation algorithms. Springer, Berlin"},{"key":"36_CR246","unstructured":"Wakabayashi Y (1986) Aggregation of binary relations: algorithmic and polyhedral investigations, PhD thesis, Augsburg university"},{"issue":"3","key":"36_CR247","first-page":"323","volume":"3","author":"Y Wakabayashi","year":"1998","unstructured":"Wakabayashi Y (1998) The Complexity of Computing Medians of Relations. Resenhas 3(3):323\u2013349","journal-title":"Resenhas"},{"key":"36_CR248","unstructured":"Wei T (1952) The Algebraic Foundations of ranking Theory. Ph D thesis, Cambridge University, Cambridge"},{"key":"36_CR249","unstructured":"Wessels H (1981) Triangulation und Blocktriangulation von Input-Output Tabellen. Deutsches Institut f\u00fcr Wirtschaftsforschung: Beitr\u00e4ge zur Strukturforshung, Heft 63, Berlin"},{"issue":"3","key":"36_CR250","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s003550200197","volume":"20","author":"GJ Woeginger","year":"2003","unstructured":"Woeginger GJ (2003) Banks winners in tournaments are difficult to recognize. Soc Choice Welfare 20(3):523\u2013528","journal-title":"Soc Choice Welfare"},{"key":"36_CR251","unstructured":"Woirgard F (1997) Recherche et d\u00e9nombrement des ordres m\u00e9dians des tournois. PhD thesis, ENST, Paris"},{"key":"36_CR252","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BFb0121198","volume":"8","author":"HP Young","year":"1978","unstructured":"Young HP (1978) On permutations and permutation polytopes. Math Program Study 8:128\u2013140","journal-title":"Math Program Study"},{"key":"36_CR253","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.2307\/1961757","volume":"82","author":"HP Young","year":"1988","unstructured":"Young HP (1988) Condorcet Theory of Voting. Am Polit Sci Rev 82:1231\u20131244","journal-title":"Am Polit Sci Rev"},{"issue":"2","key":"36_CR254","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1109\/TCT.1963.1082116","volume":"10","author":"DH Younger","year":"1963","unstructured":"Younger DH (1963) Minimum feedback arc sets for a directed graph. IEEE Trans Profes Tech Group Circuit Theory 10(2):238\u2013245","journal-title":"IEEE Trans Profes Tech Group Circuit Theory"},{"key":"36_CR255","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1007\/BF01180541","volume":"29","author":"E Zermelo","year":"1929","unstructured":"Zermelo E (1929) Die Berechnung der Turnier-Ergebnisse als ein maximal Problem der Warscheinlichkeistsrechnung. Math Zeitung 29:436\u2013460","journal-title":"Math Zeitung"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0036-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-007-0036-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0036-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,11]],"date-time":"2024-02-11T22:00:56Z","timestamp":1707688856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-007-0036-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,17]]},"references-count":255,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3,26]]}},"alternative-id":["36"],"URL":"https:\/\/doi.org\/10.1007\/s10288-007-0036-6","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,17]]}}}