Pages that link to "Item:Q1356737"
From MaRDI portal
The following pages link to New results on the computation of median orders (Q1356737):
Displaying 10 items.
- Median linear orders: Heuristics and a branch and bound algorithm (Q582183) (← links)
- Maximum distance between Slater orders and Copeland orders of tournaments (Q633222) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Approximate and dynamic rank aggregation (Q1884843) (← links)
- A new approach for identifying the Kemeny median ranking (Q2333014) (← links)
- Complexity results for extensions of median orders to different types of remoteness (Q2348767) (← 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)
- Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture (Q4521493) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)