The Rankability of Data
From MaRDI portal
Publication:5025777
DOI10.1137/18M1183595zbMath1499.90132OpenAlexW2911924834MaRDI QIDQ5025777
Amy N. Langville, Timothy P. Chartier, Paul E. Anderson
Publication date: 3 February 2022
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/18m1183595
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Fairness and the set of optimal rankings for the linear ordering problem, On the graph Laplacian and the rankability of data, Rankability and linear ordering problem: probabilistic insight and algorithms, Developing a ranking problem library (RPLIB) from a data-oriented perspective, Weight set decomposition for weighted rank and rating aggregation: an interpretable and visual decision support tool, The rankability of weighted data from pairwise comparisons, On the linear ordering problem and the rankability of data, Ranking with Hamiltonian dynamics, Erratum: The Rankability of Data
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A minimum violations ranking method
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- Statistical ranking and combinatorial Hodge theory
- Applying mod-\(k\)-cuts for solving linear ordering problems
- Finding an interior point in the optimal face of linear programs
- Sensitivity and Stability of Ranking Vectors
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Facets of the linear ordering polytope
- On the Minimum Violations Ranking of a Tournament
- Priority Ranking and Consensus Formation: The Case of Ties
- Priority Ranking and Consensus Formation
- ON THE METHOD OF PAIRED COMPARISONS
