A survey on the linear ordering problem for weighted or unweighted tournaments

DOI10.1007/S10288-007-0036-6zbMATH Open1126.05052OpenAlexW2089808326MaRDI QIDQ2644372FDOQ2644372

Authors: Irène Charon, Olivier Hudry 

Publication date: 31 August 2007

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-007-0036-6

Recommendations

• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• Strong Condorcet criterion for the linear ordering problem
• Publication:4730974
• scientific article; zbMATH DE number 1855678

zbMATH Keywords

combinatorial optimizationcombinatoricsgraph theorycomplexityfeedback arc setsocial choicevoting theorymedian orderlinear ordering problemoptimal triangulationacyclic subgraphaggregation of preferencestournament solutionsKemeny's problemreversing setSlater's problem

Mathematics Subject Classification ID

Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Directed graphs (digraphs), tournaments (05C20) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Integer programming (90C10) Paths and cycles (05C38) Combinatorics of partially ordered sets (06A07) Total orders (06A05)

Cites Work

• Un algorithme pour pallier l'effet Condorcet
• Maximum-likelihood paired comparison rankings
• Cycles of Each Length in Regular Tournaments
• Comparing the efficacy of ranking methods for multiple round-robin tournaments
• The linear ordering problem with cumulative costs
• Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
• Counterexamples to Adám's conjecture on arc reversals in directed graphs
• New results on the computation of median orders
• A 16-vertex tournament for which Banks set and Slater set are disjoint
• The Dodgson ranking and its relation to Kemeny's method and Slater's rule
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Slater's winners of a tournament may not be in the Banks set
• Title not available (Why is that?)
• Ranking the Vertices of a Paired Comparison Digraph
• Title not available (Why is that?)
• A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
• Hardness of fully dense problems
• How to recycle your facets
• 0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets
• Approximative Algorithms for Discrete Optimization Problems
• Title not available (Why is that?)
• On the maximum number of Hamiltonian paths in tournaments
• Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
• Covering relations, closest orderings and Hamiltonian bypaths in tournaments
• The reversing number of a digraph
• Tournaments as feedback arc sets
• Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
• Determining the automorphism group of the linear ordering polytope
• On the integral dicycle packings and covers and the linear ordering polytope
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope
• On the maximal order of cyclicity of antisymmetric directed graphs
• Measuring intransitivity
• Facets of linear signed order polytopes.
• Branch cuts in strongly connected graphs and permutation potentials
• Slater orders and Hamiltonian paths of tournaments
• An algorithmic view of voting
• Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Discriminant Functions and Majority Voting
• Maximum likelihood paired-comparison ranking and quadratic assignment
• Majority Decisions and Transitivity: Some Special Cases
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rankings from Paired Comparisons
• A coarseness conjecture of Erdös
• Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems
• Some Equivalence Classes in Paired Comparisons
• A Combinatorial Proof of a Conjecture of Goldberg and Moon
• Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
• Title not available (Why is that?)
• Combinatorial optimization and small polytopes
• Title not available (Why is that?)
• The median procedure in cluster analysis and social choice theory
• Title not available (Why is that?)
• Voting schemes for which it can be difficult to tell who won the election
• The linear ordering problem: instances, search space analysis and algorithms
• Title not available (Why is that?)
• THE TREATMENT OF TIES IN RANKING PROBLEMS
• Optimization, approximation, and complexity classes
• Sophisticated voting outcomes and agenda control
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Condorcet Social Choice Functions
• Title not available (Why is that?)
• New Facets of the Linear Ordering Polytope
• Ranking Tournaments
• Title not available (Why is that?)
• The omnipresence of Lagrange
• Matrix multiplication via arithmetic progressions
• Title not available (Why is that?)
• The bipartisan set of a tournament game
• Tournament solutions and majority voting
• Title not available (Why is that?)
• The Voting Problem
• Title not available (Why is that?)
• Ranking the Participants in a Tournament
• The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
• Title not available (Why is that?)
• Induced binary probabilities and the linear ordering polytope: A status report
• On the Minimum Violations Ranking of a Tournament
• Title not available (Why is that?)
• Handbook of metaheuristics
• The noising methods: A generalization of some metaheuristics
• Random generation of tournaments and asymmetric graphs with given out-degrees
• Approximating minimum feedback sets and multicuts in directed graphs
• Aggregating inconsistent information
• Parameterized algorithms for feedback set problems and their duals in tournaments
• Title not available (Why is that?)
• Metaheuristics for Hard Optimization
• Facets of the linear ordering polytope
• The maximum number of Hamiltonian paths in tournaments
• Title not available (Why is that?)
• A branch and bound algorithm for the acyclic subgraph problem
• Ranking players in multiple tournaments
• A Cutting Plane Algorithm for the Linear Ordering Problem
• Title not available (Why is that?)
• Optimal Weighted Ancestry Relationships
• Title not available (Why is that?)
• Covering sets and a new Condorcet choice correspondence
• Banks winners in tournaments are difficult to recognize
• Title not available (Why is that?)
• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• Lamarckian genetic algorithms applied to the aggregation of preferences
• A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger
• The complexity of computing medians of relations.
• A branch and bound algorithm for maximum likelihood paired comparison ranking
• Median linear orders: Heuristics and a branch and bound algorithm
• A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
• Upsets in Round Robin Tournaments
• On Sets of Consistent Arcs in a Tournament
• More facets from fences for linear ordering and acyclic subgraph polytopes
• A new heuristic algorithm solving the linear ordering problem
• An experimental evaluation of a scatter search for the linear ordering problem
• A note on small linear-ordering polytopes
• Title not available (Why is that?)
• On the acyclic subgraph polytope
• Title not available (Why is that?)
• Cyclic tournaments and cooperative majority voting: A solution
• Upsets in round robin tournaments
• A new algorithm for ranking players of a round-robin tournament
• Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
• Variable neighborhood search for the linear ordering problem
• Ranking in Tournaments and Group Decisionmaking
• The biorder polytope
• Title not available (Why is that?)
• Packing directed circuits fractionally
• Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
• A branch search algorithm for maximum likelihood paired comparison ranking
• SERIATION USING ASYMMETRIC PROXIMITY MEASURES
• Links between the Slater index and the Ryser index of tournaments
• Tournament Ranking with Expected Profit in Polynomial Time
• Constructive Quasi-Ramsey Numbers and Tournament Ranking
• Tight Bounds for the Maximum Acyclic Subgraph Problem
• On Sets of Arcs Containing No Cycles in a Tournament*
• Title not available (Why is that?)
• Optimal ranking of tournaments
• Title not available (Why is that?)
• On the maximum cardinality of a consistent set of arcs in a random tournament
• Approximations for the maximum acyclic subgraph problem
• Note—A Note on Majority Rule under Transitivity Constraints
• Majority Rule Under Transitivity Constraints
• Maximum likelihood paired comparison ranking by linear programming
• Title not available (Why is that?)
• The noising methods: A survey
• Graphs with forbidden subgraphs
• The Maximum Order of the Group of a Tournament
• A fast and effective heuristic for the feedback arc set problem
• Ordering by weighted number of wins gives a good ranking for weighted tournaments
• Title not available (Why is that?)

Cited In (28)

• Strong Condorcet criterion for the linear ordering problem
• A parameterized algorithm for subset feedback vertex set in tournaments
• Surveys in operations research
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• Voting procedures, complexity of
• A benchmark library and a comparison of heuristic methods for the linear ordering problem
• A survey on the complexity of tournament solutions
• NP-hardness results for the aggregation of linear orders into median orders
• Twelve surveys in operations research
• Rank aggregation in cyclic sequences
• A linear ordering problem of sets
• Self-tuning of the noising methods
• Weighted majority tournaments and Kemeny ranking with 2-dimensional Euclidean preferences
• Improved parameterized algorithms for the Kemeny aggregation problem
• Testing probabilistic models of choice using column generation
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• Kernels for feedback arc set in tournaments
• Computing the minimal covering set
• The linear ordering problem revisited
• A tournament of order 14 with disjoint Banks and Slater sets
• Title not available (Why is that?)
• Monotonicity-based consensus states for the monometric rationalisation of ranking rules and how they are affected by ties
• Efficient local search algorithms for the linear ordering problem
• A linear ordering problem with weighted rank
• Distance and consensus for preference relations corresponding to ordered partitions
• Query complexity of tournament solutions
• Fixed-parameter tractability results for feedback set problems in tournaments
• Randomized algorithms for lexicographic inference

Uses Software

• RAMP
• PORTA
• LOLIB

This page was built for publication: A survey on the linear ordering problem for weighted or unweighted tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2644372)