Median linear orders: Heuristics and a branch and bound algorithm-Reference-Cited by-同舟云学术

Median linear orders: Heuristics and a branch and bound algorithm

Published:1989-10 Issue:3 Volume:42 Page:313-325
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Barthelemy J.P.,Guenoche A.,Hudry O.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference29 articles.

1. Social Choice and Individual Values;Arrow,1951

2. Médianes, Condorcet, Kendall;Barbut;Mathématiques et Sciences Humaines,1967

3. The Median Procedure in Cluster Analysis and Social Choice Theory;Barthélemy;Mathematical Social Sciences,1981

4. The median procedure in data analysis: New results and open problems;Bathélemy,1988

5. Voting schemes for which it can be difficult to tell who won the election;Bartholdi;Social Choice and Welfare,1988

Cited by 51 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings;International Journal of Approximate Reasoning;2023-11

2. Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner;European Journal of Operational Research;2023-03

3. Sustainable tourism evaluation using a composite indicator with different compensatory levels;Environmental Impact Assessment Review;2022-03

4. Papers and Algorithms;Feedback Arc Set;2022

5. Efficient, robust and effective rank aggregation for massive biological datasets;Future Generation Computer Systems;2021-11