Median linear orders: Heuristics and a branch and bound algorithm
From MaRDI portal
(Redirected from Publication:582183)
Recommendations
- New results on the computation of median orders
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
- scientific article; zbMATH DE number 878679
- scientific article; zbMATH DE number 1022239
- On the computation of median linear orders, of median complete preorders and of median weak orders
Cites work
- scientific article; zbMATH DE number 3833066 (Why is no real title available?)
- scientific article; zbMATH DE number 3425631 (Why is no real title available?)
- scientific article; zbMATH DE number 3153649 (Why is no real title available?)
- scientific article; zbMATH DE number 3980481 (Why is no real title available?)
- scientific article; zbMATH DE number 4005933 (Why is no real title available?)
- scientific article; zbMATH DE number 3683305 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3303831 (Why is no real title available?)
- A Consistent Extension of Condorcet’s Election Principle
- A branch and bound algorithm for the acyclic subgraph problem
- Facets of the linear ordering polytope
- Maximum likelihood paired comparison ranking by linear programming
- Maximum-likelihood paired comparison rankings
- On the acyclic subgraph polytope
- Social choice and individual values
- The median procedure in cluster analysis and social choice theory
- Un algorithme pour pallier l'effet Condorcet
- Voting schemes for which it can be difficult to tell who won the election
Cited in
(20)- Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
- A new approach for identifying the Kemeny median ranking
- Models for concurrent product and process design
- Voting procedures, complexity of
- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings
- On some relations between 2-trees and tree metrics
- On the computation of median linear orders, of median complete preorders and of median weak orders
- On the complexity of crossings in permutations
- Approximate and dynamic rank aggregation
- An influence analysis of the number of members on the quality of knowledge in a collective
- Geometric and combinatorial properties of the polytope of binary choice probabilities
- A METHOD FOR ONTOLOGY CONFLICT RESOLUTION AND INTEGRATION ON RELATION LEVEL
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Single or multiple consensus for linear orders
- A survey on the linear ordering problem for weighted or unweighted tournaments
- scientific article; zbMATH DE number 1855678 (Why is no real title available?)
- New results on the computation of median orders
- Ranking data with ordinal labels: optimality and pairwise aggregation
- Choosing from a weighted tournament
This page was built for publication: Median linear orders: Heuristics and a branch and bound algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582183)