A survey on the linear ordering problem for weighted or unweighted tournaments
From MaRDI portal
Publication:2644372
DOI10.1007/s10288-007-0036-6zbMath1126.05052OpenAlexW2089808326MaRDI QIDQ2644372
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
combinatoricscomplexitycombinatorial optimizationvoting theorygraph theorysocial choiceacyclic subgraphfeedback arc setmedian orderoptimal triangulationlinear ordering problemaggregation of preferencestournament solutionsKemeny's problemreversing setSlater's problem
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorics of partially ordered sets (06A07) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20) Total orders (06A05)
Related Items
The linear ordering problem revisited, Twelve surveys in operations research, Testing probabilistic models of choice using column generation, A linear ordering problem of sets, Monotonicity-based consensus states for the monometric rationalisation of ranking rules and how they are affected by ties, A parameterized algorithm for subset feedback vertex set in tournaments, A linear ordering problem with weighted rank, Query complexity of tournament solutions, A benchmark library and a comparison of heuristic methods for the linear ordering problem, Randomized Algorithms for Lexicographic Inference, Kernels for feedback arc set in tournaments, Surveys in operations research, Efficient local search algorithms for the linear ordering problem, Voting Procedures, Complexity of, Computing the minimal covering set, Rank aggregation in cyclic sequences, A tournament of order 14 with disjoint Banks and Slater sets, An updated survey on the linear ordering problem for weighted or unweighted tournaments, Fixed-parameter tractability results for feedback set problems in tournaments, NP-hardness results for the aggregation of linear orders into median orders, Distance and consensus for preference relations corresponding to ordered partitions, Self-tuning of the noising methods, Improved Parameterized Algorithms for the Kemeny Aggregation Problem, A survey on the complexity of tournament solutions
Uses Software
Cites Work
- Median linear orders: Heuristics and a branch and bound algorithm
- A fast and effective heuristic for the feedback arc set problem
- On the maximum cardinality of a consistent set of arcs in a random tournament
- Slater's winners of a tournament may not be in the Banks set
- Covering relations, closest orderings and Hamiltonian bypaths in tournaments
- Parameterized algorithms for feedback set problems and their duals in tournaments
- Cyclic tournaments and cooperative majority voting: A solution
- Matrix multiplication via arithmetic progressions
- Upsets in round robin tournaments
- A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
- Sophisticated voting outcomes and agenda control
- Counterexamples to Adám's conjecture on arc reversals in directed graphs
- Covering sets and a new Condorcet choice correspondence
- Voting schemes for which it can be difficult to tell who won the election
- A branch and bound algorithm for the acyclic subgraph problem
- The median procedure in cluster analysis and social choice theory
- Induced binary probabilities and the linear ordering polytope: A status report
- Optimization, approximation, and complexity classes
- The bipartisan set of a tournament game
- On the maximal order of cyclicity of antisymmetric directed graphs
- Measuring intransitivity
- Random generation of tournaments and asymmetric graphs with given out-degrees
- Intensification and diversification with elite tabu search solutions for the linear ordering problem
- More facets from fences for linear ordering and acyclic subgraph polytopes
- Approximations for the maximum acyclic subgraph problem
- A new algorithm for ranking players of a round-robin tournament
- New results on the computation of median orders
- Tournament solutions and majority voting
- A 16-vertex tournament for which Banks set and Slater set are disjoint
- Approximating minimum feedback sets and multicuts in directed graphs
- Lamarckian genetic algorithms applied to the aggregation of preferences
- Links between the Slater index and the Ryser index of tournaments
- Facets of linear signed order polytopes.
- Comparing the efficacy of ranking methods for multiple round-robin tournaments
- A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
- The biorder polytope
- The Dodgson ranking and its relation to Kemeny's method and Slater's rule
- A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger
- The linear ordering problem: instances, search space analysis and algorithms
- Combinatorial optimization and small polytopes
- A new heuristic algorithm solving the linear ordering problem
- An experimental evaluation of a scatter search for the linear ordering problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The reversing number of a digraph
- On the integral dicycle packings and covers and the linear ordering polytope
- Packing directed circuits fractionally
- Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
- Tournaments as feedback arc sets
- On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- The maximum number of Hamiltonian paths in tournaments
- A note on small linear-ordering polytopes
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
- The linear ordering problem with cumulative costs
- Variable neighborhood search for the linear ordering problem
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs
- How to recycle your facets
- Graphs with forbidden subgraphs
- Branch cuts in strongly connected graphs and permutation potentials
- Ranking players in multiple tournaments
- Banks winners in tournaments are difficult to recognize
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
- Hardness of fully dense problems
- On the maximum number of Hamiltonian paths in 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
- Ranking in Tournaments and Group Decisionmaking
- A Cutting Plane Algorithm for the Linear Ordering Problem
- The Voting Problem
- The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
- Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
- Ranking the Vertices of a Paired Comparison Digraph
- On the acyclic subgraph polytope
- Facets of the linear ordering polytope
- On the Minimum Violations Ranking of a Tournament
- Tournament Ranking with Expected Profit in Polynomial Time
- Ranking the Participants in a Tournament
- A branch search algorithm for maximum likelihood paired comparison ranking
- Optimal Weighted Ancestry Relationships
- Discriminant Functions and Majority Voting
- Maximum likelihood paired-comparison ranking and quadratic assignment
- SERIATION USING ASYMMETRIC PROXIMITY MEASURES
- Majority Decisions and Transitivity: Some Special Cases
- Un algorithme pour pallier l'effet Condorcet
- Note—A Note on Majority Rule under Transitivity Constraints
- Condorcet Social Choice Functions
- Approximative Algorithms for Discrete Optimization Problems
- Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
- Constructive Quasi-Ramsey Numbers and Tournament Ranking
- Tight Bounds for the Maximum Acyclic Subgraph Problem
- New Facets of the Linear Ordering Polytope
- Majority Rule Under Transitivity Constraints
- Metaheuristics for Hard Optimization
- 0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets
- Ranking Tournaments
- Upsets in Round Robin Tournaments
- On Sets of Consistent Arcs in a Tournament
- Rankings from Paired Comparisons
- Maximum-likelihood paired comparison rankings
- Cycles of Each Length in Regular Tournaments
- 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
- On Sets of Arcs Containing No Cycles in a Tournament*
- Maximum likelihood paired comparison ranking by linear programming
- The Maximum Order of the Group of a Tournament
- Optimal ranking of tournaments
- A branch and bound algorithm for maximum likelihood paired comparison ranking
- THE TREATMENT OF TIES IN RANKING PROBLEMS
- Aggregating inconsistent information
- Ordering by weighted number of wins gives a good ranking for weighted tournaments
- The omnipresence of Lagrange
- Handbook of metaheuristics
- Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
- Determining the automorphism group of the linear ordering polytope
- The noising methods: A generalization of some metaheuristics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
