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

DOI10.1016/j.dam.2005.04.020zbMath1111.90121OpenAlexW2022810394MaRDI QIDQ2433800

Olivier Hudry, Irène Charon

Publication date: 30 October 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.04.020

zbMATH Keywords

Lagrangean relaxationbranch and boundtournamentsmedian orderlinear ordering problemKemeny's problemSlater's problemnoising methods

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Directed graphs (digraphs), tournaments (05C20)

Related Items (13)

The linear ordering problem revisited ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings ⋮ Determining the results of tournament games using complete graphs generation ⋮ Tournament scoring problem ⋮ Voting Procedures, Complexity of ⋮ A tournament of order 14 with disjoint Banks and Slater sets ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ The noising methods: A generalization of some metaheuristics ⋮ Block-insertion-based algorithms for the linear ordering problem ⋮ Self-tuning of the noising methods ⋮ Models for concurrent product and process design ⋮ Bounds on the disparity and separation of tournament solutions

Uses Software

• PORTA
• LOLIB

Cites Work

• 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
• Median linear orders: Heuristics and a branch and bound algorithm
• On the use of ordered sets in problems of comparison and consensus of classifications
• A branch and bound algorithm for the acyclic subgraph problem
• The median procedure in cluster analysis and social choice theory
• The noising method: A new method for combinatorial optimization
• New results on the computation of median orders
• Lamarckian genetic algorithms applied to the aggregation of preferences
• Combinatorial optimization and small polytopes
• Metaheuristics: A bibliography
• Branch cuts in strongly connected graphs and permutation potentials
• A Cutting Plane Algorithm for the Linear Ordering Problem
• Self-tuning of the noising methods
• A branch search algorithm for maximum likelihood paired comparison ranking
• SERIATION USING ASYMMETRIC PROXIMITY MEASURES
• Un algorithme pour pallier l'effet Condorcet
• Maximum-likelihood paired comparison rankings
• Zwei Algorithmen zur Lösung eines komplexen Reihenfolgeproblems
• Maximum likelihood paired comparison ranking by linear programming
• A branch and bound algorithm for maximum likelihood paired comparison ranking
• The noising methods: A generalization of some metaheuristics

This page was built for publication: A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments