An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5733165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of Hamiltonian paths in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of fully dense problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregating inconsistent information / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimum Violations Ranking of a Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of Hamiltonian paths in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of Each Length in Regular Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Proof of a Conjecture of Goldberg and Moon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new rounding procedure for the assignment problem with applications to dense graph arrangement problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sophisticated voting outcomes and agenda control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering relations, closest orderings and Hamiltonian bypaths in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The median procedure in cluster analysis and social choice theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Median linear orders: Heuristics and a branch and bound algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reversing number of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voting schemes for which it can be difficult to tell who won the election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for the Maximum Acyclic Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5650707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear ordering problem with cumulative costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—A Note on Majority Rule under Transitivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discriminant Functions and Majority Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Facets of the Linear Ordering Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majority Rule Under Transitivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upsets in round robin tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3346350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for the Quadratic Linear Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch cuts in strongly connected graphs and permutation potentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the number of Hamiltonian paths in strong tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental evaluation of a scatter search for the linear ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-Independent Scatter and Tabu Search for Permutation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite ordered sets. Concepts, results and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic algorithm solving the linear ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revised GRASP with path-relinking for the linear ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lamarckian genetic algorithms applied to the aggregation of preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The noising methods: A generalization of some metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Links between the Slater index and the Ryser index of tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the linear ordering problem for weighted or unweighted tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-tuning of the noising methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum distance between Slater orders and Copeland orders of tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4880988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of tournaments and asymmetric graphs with given out-degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the computation of median orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 16-vertex tournament for which Banks set and Slater set are disjoint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization and small polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of using small instance relaxations in parallel branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: The biorder polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4243442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4118980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking players in multiple tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by weighted number of wins gives a good ranking for weighted tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive Quasi-Ramsey Numbers and Tournament Ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum likelihood paired comparison ranking by linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for maximum likelihood paired comparison ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum cardinality of a consistent set of arcs in a random tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Order of the Group of a Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the linear ordering polytope: a unification for the fence family through weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics for Hard Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering sets and a new Condorcet choice correspondence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and effective heuristic for the feedback arc set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Consistent Arcs in a Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum feedback sets and multicuts in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide-and-conquer approximation algorithms via spreading metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic View of Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the automorphism group of the linear ordering polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to recycle your facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: 0, 1/2‐Cuts and the Linear Ordering Problem: Surfaces That Define Facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of linear signed order polytopes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condorcet Social Choice Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced binary probabilities and the linear ordering polytope: A status report / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch search algorithm for maximum likelihood paired comparison ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upsets in Round Robin Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation analysis of efficient heuristic algorithms for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the linear ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Weighted Ancestry Relationships / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking in Tournaments and Group Decisionmaking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cutting Plane Algorithm for the Linear Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem on a graph and some related integer polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the linear ordering polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Un algorithme pour pallier l'effet Condorcet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coarseness conjecture of Erdös / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for the maximum acyclic subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Kemeny elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4436933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SERIATION USING ASYMMETRIC PROXIMITY MEASURES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum likelihood paired-comparison ranking and quadratic assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4946665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on ``Bank winners in tournaments are difficult to recognize'' by G. J. Woeginger / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness results for the aggregation of linear orders into median orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the complexity of tournament solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of Slater's problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournaments as feedback arc sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5607735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the acyclic subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Equivalence Classes in Paired Comparisons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking the Vertices of a Paired Comparison Digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for ranking players of a round-robin tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NEW MEASURE OF RANK CORRELATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE TREATMENT OF TIES IN RANKING PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dodgson ranking and its relation to Kemeny's method and Slater's rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximative Algorithms for Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal order of cyclicity of antisymmetric directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slater's winners of a tournament may not be in the Banks set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bipartisan set of a tournament game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intensification and diversification with elite tabu search solutions for the linear ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament solutions and majority voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The omnipresence of Lagrange / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4060764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More facets from fences for linear ordering and acyclic subgraph polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voting in the Medieval Papacy and Religious Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing the efficacy of ranking methods for multiple round-robin tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majority Decisions and Transitivity: Some Special Cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experience with an Interior Point Cutting Plane Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving real-world linear ordering problems using a primal-dual interior point cutting plane method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3215236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3211275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring intransitivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the integral dicycle packings and covers and the linear ordering polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-\(\{0,{1\over 2},1\}\) extreme points of the generalized transitive tournament polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tournament of order 14 with disjoint Banks and Slater sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament Ranking with Expected Profit in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for feedback set problems and their duals in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Approximation Techniques for Some Linear Ordering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of Dodgson's method and Kemeny's rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Arcs Containing No Cycles in a Tournament* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on small linear-ordering polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rankings from Paired Comparisons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-likelihood paired comparison rankings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for the linear ordering problem with cumulative costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking the Participants in a Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5337210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient local search algorithms for the linear ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear ordering problem: instances, search space analysis and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic tournaments and cooperative majority voting: A solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing directed circuits fractionally / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal ranking of tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Voting Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexamples to Adám's conjecture on arc reversals in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3745273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Banks winners in tournaments are difficult to recognize / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3858272 / rank
 
Normal rank

Revision as of 19:14, 2 July 2024

scientific article
Language Label Description Also known as
English
An updated survey on the linear ordering problem for weighted or unweighted tournaments
scientific article

    Statements

    An updated survey on the linear ordering problem for weighted or unweighted tournaments (English)
    0 references
    0 references
    0 references
    10 May 2010
    0 references
    aggregation of preferences
    0 references
    voting theory
    0 references
    social choice
    0 references
    linear ordering problem
    0 references
    Kemeny's problem
    0 references
    Slater's problem
    0 references
    median order
    0 references
    reversing set
    0 references
    feedback arc set
    0 references
    acyclic subgraph
    0 references
    optimal triangulation
    0 references
    graph theory
    0 references
    tournament solutions
    0 references
    complexity
    0 references
    combinatorial optimization
    0 references
    combinatorics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references