Pages that link to "Item:Q970187"
From MaRDI portal
The following pages link to An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187):
Displaying 23 items.
- On the computation of median linear orders, of median complete preorders and of median weak orders (Q449031) (← links)
- Maximum distance between Slater orders and Copeland orders of tournaments (Q633222) (← links)
- On the complexity of Slater's problems (Q1043351) (← links)
- Monotonicity-based consensus states for the monometric rationalisation of ranking rules and how they are affected by ties (Q1679657) (← links)
- Evidential reasoning in large partially ordered sets. Application to multi-label classification, ensemble clustering and preference aggregation (Q1761871) (← links)
- Beyond pairwise comparisons in social choice: a setwise Kemeny aggregation problem (Q2072062) (← links)
- A linear ordering problem of sets (Q2173116) (← links)
- A new consensus ranking approach for correlated ordinal information based on Mahalanobis distance (Q2282266) (← links)
- Block-insertion-based algorithms for the linear ordering problem (Q2289935) (← links)
- Probabilistic transitivity in sports (Q2329722) (← links)
- Bayesian inference and model comparison for random choice structures (Q2343780) (← links)
- Bounds on the disparity and separation of tournament solutions (Q2348052) (← links)
- Complexity results for extensions of median orders to different types of remoteness (Q2348767) (← links)
- Decomposability index of tournaments (Q2404390) (← links)
- Scheduling interrelated activities in complex projects under high-order rework: a DSM-based approach (Q2668674) (← links)
- Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
- Linear time algorithms to solve the linear ordering problem for oriented tree based graphs (Q2805488) (← links)
- Robust Learning of Consumer Preferences (Q5080653) (← links)
- Randomized Algorithms for Lexicographic Inference (Q5126607) (← links)
- Surprises in Knockout Tournaments (Q5137081) (← links)
- Rankability and linear ordering problem: probabilistic insight and algorithms (Q6047898) (← links)
- A linear ordering problem with weighted rank (Q6117320) (← links)
- Adjacencies on random ordering polytopes and flow polytopes (Q6134082) (← links)
