A linear ordering problem of sets
From MaRDI portal
Recommendations
- Distance and consensus for preference relations corresponding to ordered partitions
- Comparing and aggregating partial orders with Kendall tau distances
- Fairness and the set of optimal rankings for the linear ordering problem
- Metric methods for analyzing partially ranked data
- Comparing and aggregating partial orders with Kendall tau distances
Cites work
- A Consistent Extension of Condorcet’s Election Principle
- A NEW MEASURE OF RANK CORRELATION
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Aggregating inconsistent information: ranking and clustering
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Comparing Partial Rankings
- Maximum distance between Slater orders and Copeland orders of tournaments
- On the complexity of Slater's problems
- Optimal Weighted Ancestry Relationships
- Probabilistic asymptotic properties of some combinatorial optimization problems
- Rank aggregation in cyclic sequences
- Social choice and individual values
- The Benders decomposition algorithm: a literature review
- The Borda majority count
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
Cited in
(6)- Exploring the robustness of country rankings by educational attainment
- The linear ordering problem with clusters: a new partial ranking
- scientific article; zbMATH DE number 3821436 (Why is no real title available?)
- A problem on well ordered sets
- Order matters when choosing sets
- A linear ordering problem with weighted rank
This page was built for publication: A linear ordering problem of sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2173116)