Pages that link to "Item:Q2503315"
From MaRDI portal
The following pages link to An efficient approach for the rank aggregation problem (Q2503315):
Displaying 19 items.
- Efficient algorithms for local ranking (Q436589) (← links)
- A note on permutations and rank aggregation (Q611777) (← links)
- Computing distances between partial rankings (Q976084) (← links)
- A note on generalized rank aggregation (Q989442) (← links)
- On the hardness of maximum rank aggregation problems (Q2018536) (← links)
- Optimizing positional scoring rules for rank aggregation (Q2321258) (← links)
- A project portfolio selection problem in a group decision-making context (Q2358859) (← links)
- An algorithm for rank aggregation problem (Q2383708) (← links)
- Aggregating preferences represented by conditional preference networks (Q2695422) (← links)
- (Q3088299) (← links)
- From rankings’ collinearity to counting SDR's via chromatic list expression (Q3396413) (← links)
- (Q4900317) (← links)
- Fuzzy K-Minpen Clustering and K-nearest-minpen Classification Procedures Incorporating Generic Distance-Based Penalty Minimizers (Q5117225) (← links)
- Using balanced iterative reducing and clustering hierarchies to compute approximate rank statistics on massive datasets (Q5219487) (← links)
- Ranking with a P-Norm Push (Q5307595) (← links)
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems (Q5443388) (← links)
- Developing a ranking problem library (RPLIB) from a data-oriented perspective (Q6050403) (← links)
- Use of the Reduced Tolerance Approach to Rank Efficient Solutions (Q6160394) (← links)
- Move schedules: fast persistence computations in coarse dynamic settings (Q6589170) (← links)
