Pages that link to "Item:Q107991"
From MaRDI portal
The following pages link to Efficient algorithms using subiterative convergence for Kemeny ranking problem (Q107991):
Displaying 6 items.
- RankAggSIgFUR (Q107992) (← links)
- Exploring the median of permutations problem (Q1711664) (← links)
- Median constrained bucket order rank aggregation (Q2418073) (← links)
- A data-driven matching algorithm for ride pooling problem (Q2669782) (← links)
- Computing kemeny rankings from \(d\)-Euclidean preferences (Q2695434) (← links)
- Approximate Condorcet partitioning: solving large-scale rank aggregation problems (Q6164371) (← links)
