Pages that link to "Item:Q2383708"
From MaRDI portal
The following pages link to An algorithm for rank aggregation problem (Q2383708):
Displaying 14 items.
- Efficient algorithms using subiterative convergence for Kemeny ranking problem (Q107991) (← links)
- A new proposal for fusing individual preference orderings by rank-ordered agents: a generalization of the Yager's algorithm (Q320906) (← links)
- Rank aggregation in cyclic sequences (Q523159) (← links)
- A novel algorithm for fusing preference orderings by rank-ordered agents (Q529260) (← links)
- A note on permutations and rank aggregation (Q611777) (← links)
- Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem (Q724004) (← links)
- Fixed-parameter algorithms for Kemeny rankings (Q1035688) (← links)
- Lamarckian genetic algorithms applied to the aggregation of preferences (Q1392449) (← links)
- Approximate and dynamic rank aggregation (Q1884843) (← links)
- On the hardness of maximum rank aggregation problems (Q2018536) (← links)
- Median constrained bucket order rank aggregation (Q2418073) (← links)
- Approaching the rank aggregation problem by local search-based metaheuristics (Q2423564) (← links)
- (Q3088299) (← links)
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems (Q5443388) (← links)