An updated survey on the linear ordering problem for weighted or unweighted tournaments
An updated survey on the linear ordering problem for weighted or unweighted tournaments
复制标题
关于加权或非加权锦标赛的线性排序问题的最新调查
DOI：
10.1007/s10479-009-0648-7
复制
发表时间：
2010
影响因子：
4.8
通讯作者：
O. Hudry
中科院分区：
文献类型：
--
作者：
I. Charon;O. Hudry
本文综述了线性排序问题的组合和算法方面的一些结果、猜想和开放问题。这个问题包括找到一个线性顺序，这是在距离（加权或不加权）比赛的最小距离。我们展示了如何使用它来建模聚合问题，包括从一组候选人上定义的个人偏好到这些候选人的集体排名。
In this paper, we survey some results, conjectures and open problems dealing with the combinatorial and algorithmic aspects of the linear ordering problem. This problem consists in finding a linear order which is at minimum distance from a (weighted or not) tournament. We show how it can be used to model an aggregation problem consisting of going from individual preferences defined on a set of candidates to a collective ranking of these candidates.