Developing a ranking problem library (RPLIB) from a data-oriented perspective

DOI10.1007/s11081-022-09771-yarXiv2206.11258MaRDI QIDQ6050403

Kathryn E. Pedings-Behling, Brandon Tat, Paul E. Anderson, Charlie Ward, Amy N. Langville

Publication date: 18 September 2023

Published in: Optimization and Engineering (Search for Journal in Brave)

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

zbMATH Keywords

linear programminginteger programmingartificial datalinear ordering problemrankabilityColley rankingsMassey rankingsranking problem library

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Cites Work

• A minimum violations ranking method
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• Fairness and the set of optimal rankings for the linear ordering problem
• On the graph Laplacian and the rankability of data
• A Cutting Plane Algorithm for the Linear Ordering Problem
• The Rankability of Data

This page was built for publication: Developing a ranking problem library (RPLIB) from a data-oriented perspective