A supervised learning approach to rankability

DOI10.1016/J.COR.2025.107049MaRDI QIDQ6974826zbMATH OpenFDO

Authors Nathan McJames, David Malone, Oliver Mason

Publication date 5 June 2025

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

Full work available at URL https://doi.org/10.1016/J.COR.2025.107049

zbMATH Keywords

supervised learningrankingrankability

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• scientific article; zbMATH DE number 3473182 (Why is no real title available?)
• A benchmark library and a comparison of heuristic methods for the linear ordering problem
• Algebraic connectivity of directed graphs
• Analytic hierarchy process: an overview of applications
• Developing a ranking problem library (RPLIB) from a data-oriented perspective
• On the graph Laplacian and the rankability of data
• Polynomial Equations and Circulant Matrices
• Rankability and linear ordering problem: probabilistic insight and algorithms
• Scikit-learn: machine learning in Python
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• The rankability of data
• The rankability of weighted data from pairwise comparisons

This page was built for publication: A supervised learning approach to rankability

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