Rank aggregation in cyclic sequences

DOI10.1007/s11590-016-1047-zzbMath1367.90094OpenAlexW2416400532MaRDI QIDQ523159

Mercedes Landete, Justo Puerto, Eva M. García-Nové, Javier Alcaraz, Juan Francisco Monge

Publication date: 20 April 2017

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/xmlui/handle/11441/50683

zbMATH Keywords

linear ordering problemrank aggregation problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (3)

The linear ordering problem with clusters: a new partial ranking ⋮ A linear ordering problem of sets ⋮ Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem

Uses Software

• TSPLIB
• LOLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Experiments with Kemeny ranking: What works when?
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• Applying mod-\(k\)-cuts for solving linear ordering problems
• Tackling the rank aggregation problem with evolutionary algorithms
• More facets from fences for linear ordering and acyclic subgraph polytopes
• Fence facets from non-regular graphs for the linear ordering polytope
• A survey on the linear ordering problem for weighted or unweighted tournaments
• Facets of the linear ordering polytope
• TSPLIB—A Traveling Salesman Problem Library
• Rank Aggregation: Together We're Strong

This page was built for publication: Rank aggregation in cyclic sequences