Median linear orders: Heuristics and a branch and bound algorithm

DOI10.1016/0377-2217(89)90442-6zbMATH Open0689.90003OpenAlexW2089788538MaRDI QIDQ582183FDOQ582183

Authors: Olivier Hudry, J. P. Barthélemy, 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

Recommendations

• New results on the computation of median orders
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• scientific article; zbMATH DE number 878679
• scientific article; zbMATH DE number 1022239
• On the computation of median linear orders, of median complete preorders and of median weak orders

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• The median procedure in cluster analysis and social choice theory
• Social choice and individual values
• Voting schemes for which it can be difficult to tell who won the election
• Title not available (Why is that?)
• A Consistent Extension of Condorcet’s Election Principle
• Title not available (Why is that?)
• Title not available (Why is that?)
• Facets of the linear ordering polytope
• A branch and bound algorithm for the acyclic subgraph problem
• On the acyclic subgraph polytope
• Maximum likelihood paired comparison ranking by linear programming
• 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?)
• Un algorithme pour pallier l'effet Condorcet
• Maximum-likelihood paired comparison rankings

Cited In (20)

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

This page was built for publication: Median linear orders: Heuristics and a branch and bound algorithm

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