Pages that link to "Item:Q3747180"

The following pages link to An axiomatic approach to distance on partial orderings (Q3747180):

Displaying 12 items.

• A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach (Q62336) (← links)
• Efficient algorithms using subiterative convergence for Kemeny ranking problem (Q107991) (← links)
• Comparing series of rankings with ties by using complex networks: an analysis of the Spanish stock market (IBEX-35 index) (Q258462) (← links)
• A new distance measure including the weak preference relation: application to the multiple criteria aggregation procedure for mixed evaluations (Q296644) (← links)
• Deriving a minimum distance-based collective preorder: a binary mathematical programming approach (Q421078) (← links)
• Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem (Q724004) (← links)
• Mining maximum consensus sequences from group ranking data (Q1027615) (← links)
• Weighted distance-based trees for ranking data (Q1999451) (← links)
• An agglomerative hierarchical clustering algorithm for linear ordinal rankings (Q2127073) (← links)
• Comparing boosting and bagging for decision trees of rankings (Q2129304) (← links)
• Consensus among preference rankings: a new weighted correlation coefficient for linear and weak orderings (Q2673352) (← links)
• An axiomatic distance methodology for aggregating multimodal evaluations (Q6199498) (← links)