Pages that link to "Item:Q582183"

The following pages link to Median linear orders: Heuristics and a branch and bound algorithm (Q582183):

Displaying 18 items.

• Ranking data with ordinal labels: optimality and pairwise aggregation (Q374178) (← links)
• An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
• On the complexity of crossings in permutations (Q1011761) (← links)
• Models for concurrent product and process design (Q1046061) (← links)
• Geometric and combinatorial properties of the polytope of binary choice probabilities (Q1184363) (← links)
• New results on the computation of median orders (Q1356737) (← links)
• Choosing from a weighted tournament (Q1575093) (← links)
• On some relations between 2-trees and tree metrics (Q1584450) (← links)
• Approximate and dynamic rank aggregation (Q1884843) (← links)
• Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner (Q2103031) (← links)
• A new approach for identifying the Kemeny median ranking (Q2333014) (← links)
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments (Q2433800) (← links)
• A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
• A METHOD FOR ONTOLOGY CONFLICT RESOLUTION AND INTEGRATION ON RELATION LEVEL (Q3393453) (← links)
• Voting Procedures, Complexity of (Q5150301) (← links)
• Single or Multiple Consensus for Linear Orders (Q5270624) (← links)
• An influence analysis of the number of members on the quality of knowledge in a collective (Q5283398) (← links)
• A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings (Q6066864) (← links)