Median linear orders: Heuristics and a branch and bound algorithm

DOI10.1016/0377-2217(89)90442-6zbMath0689.90003OpenAlexW2089788538MaRDI QIDQ582183

Olivier Hudry, Jean-Pierre Barthelemy, Alain Guénoche

Publication date: 1989

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90442-6

zbMATH Keywords

heuristicsbranch and boundmulticriteria decision aidmedian linear ordersminimum arc set problemminimum feedback arc set problemnon-weighed tournaments

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Individual preferences (91B08) Social choice (91B14)

Related Items

An influence analysis of the number of members on the quality of knowledge in a collective, Approximate and dynamic rank aggregation, New results on the computation of median orders, A survey on the linear ordering problem for weighted or unweighted tournaments, Ranking data with ordinal labels: optimality and pairwise aggregation, A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings, A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments, Geometric and combinatorial properties of the polytope of binary choice probabilities, Voting Procedures, Complexity of, An updated survey on the linear ordering problem for weighted or unweighted tournaments, On the complexity of crossings in permutations, A METHOD FOR ONTOLOGY CONFLICT RESOLUTION AND INTEGRATION ON RELATION LEVEL, Choosing from a weighted tournament, Models for concurrent product and process design, On some relations between 2-trees and tree metrics, A new approach for identifying the Kemeny median ranking, Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner, Single or Multiple Consensus for Linear Orders

Cites Work

• 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
• On the acyclic subgraph polytope
• Facets of the linear ordering polytope
• Un algorithme pour pallier l'effet Condorcet
• A Consistent Extension of Condorcet’s Election Principle
• Maximum-likelihood paired comparison rankings
• Maximum likelihood paired comparison ranking by linear programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item