Fairness and the set of optimal rankings for the linear ordering problem
From MaRDI portal
Publication:2168622
Recommendations
Cites work
- A Cutting Plane Algorithm for the Linear Ordering Problem
- A minimum violations ranking method
- Finding an interior point in the optimal face of linear programs
- scientific article; zbMATH DE number 3902051 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- On the Minimum Violations Ranking of a Tournament
- SCIP: solving constraint integer programs
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- The linear ordering problem: instances, search space analysis and algorithms
- The rankability of data
- The rankability of weighted data from pairwise comparisons
Cited in
(9)- On the linear ordering problem and the rankability of data
- A linear ordering problem of sets
- scientific article; zbMATH DE number 4072701 (Why is no real title available?)
- A linear ordering of a multi-parameter universe is usually nonsense
- Ranking with Fairness Constraints
- Rankability and linear ordering problem: probabilistic insight and algorithms
- Developing a ranking problem library (RPLIB) from a data-oriented perspective
- A linear ordering problem with weighted rank
- Multiple linear ordering problem
This page was built for publication: Fairness and the set of optimal rankings for the linear ordering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168622)