Median linear orders: Heuristics and a branch and bound algorithm
The first part of this paper illustrates the relationship between median linear orders and the so-called minimum arc set problem. In the second part a heuristic is studied to solve the minimum feedback arc set problem for non-weighed tournaments, which is then extended to the general case (weighed tournaments). In the last part, a branch and bound (b \& b) method is designed to get all median linear orders associated with a profile of linear orders. Among the advantages of the b \& b method are: (1) whereas most methods are only able to compute just one median linear order, b \& b computes all of them; (2) b \& b always provides exact integer solutions; (3) the algorithm for the b \& b method can be easily set up on any microcomputer for reasonable sized data.
- 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
- A branch and bound algorithm for the acyclic subgraph problem
- A Consistent Extension of Condorcet’s Election Principle
- Facets of the linear ordering polytope
- 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?)
- 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
- On the complexity of crossings in permutations
- Models for concurrent product and process design
- Geometric and combinatorial properties of the polytope of binary choice probabilities
- New results on the computation of median orders
- Choosing from a weighted tournament
- On some relations between 2-trees and tree metrics
- Approximate and dynamic rank aggregation
- Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner
- A new approach for identifying the Kemeny median ranking
- A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
- A survey on the linear ordering problem for weighted or unweighted tournaments
- A METHOD FOR ONTOLOGY CONFLICT RESOLUTION AND INTEGRATION ON RELATION LEVEL
- Ranking data with ordinal labels: optimality and pairwise aggregation
- scientific article; zbMATH DE number 1022239 (Why is no real title available?)
- On the computation of median linear orders, of median complete preorders and of median weak orders
- scientific article; zbMATH DE number 1855678 (Why is no real title available?)
- scientific article; zbMATH DE number 878679 (Why is no real title available?)
- Voting procedures, complexity of
- Single or multiple consensus for linear orders
- An influence analysis of the number of members on the quality of knowledge in a collective
- Median for an odd number of linear order relations and its use in group choice problems
- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings
- Consensus formation from heterogeneous rankings based on minimum variance
- Robust multi-label classification via preference learning
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
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)
