Rankability and linear ordering problem: probabilistic insight and algorithms

DOI10.1016/j.cor.2023.106347arXiv2208.03860MaRDI QIDQ6047898

Harsh Sukheja, Leszek L. Szczeciński

Publication date: 13 September 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.03860

zbMATH Keywords

rankingcombinatorial optimizationBayesian estimationlinear ordering problemrankability

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• A benchmark library and a comparison of heuristic methods for the linear ordering problem
• An updated survey on the linear ordering problem for weighted or unweighted tournaments
• A generalized approach to maximum likelihood paired comparison ranking
• The rankability of weighted data from pairwise comparisons
• On the linear ordering problem and the rankability of data
• Fairness and the set of optimal rankings for the linear ordering problem
• Probabilistic transitivity in sports
• The linear ordering problem revisited
• The Rankability of Data
• Maximum-likelihood paired comparison rankings
• Maximum likelihood paired comparison ranking by linear programming

This page was built for publication: Rankability and linear ordering problem: probabilistic insight and algorithms