Pages that link to "Item:Q449031"
From MaRDI portal
The following pages link to On the computation of median linear orders, of median complete preorders and of median weak orders (Q449031):
Displaying 9 items.
- Median linear orders: Heuristics and a branch and bound algorithm (Q582183) (← links)
- Primary facets of order polytopes (Q730181) (← links)
- New results on the computation of median orders (Q1356737) (← links)
- NP-hardness results for the aggregation of linear orders into median orders (Q2271866) (← links)
- A new consensus ranking approach for correlated ordinal information based on Mahalanobis distance (Q2282266) (← links)
- Complexity results for extensions of median orders to different types of remoteness (Q2348767) (← links)
- The complexity of computing medians of relations. (Q2766482) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- A note on clustering aggregation for binary clusterings (Q6556150) (← links)