Exploring the median of permutations problem
From MaRDI portal
Publication:1711664
DOI10.1016/j.jda.2018.11.007zbMath1410.68343OpenAlexW2901207548MaRDI QIDQ1711664
Publication date: 18 January 2019
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2018.11.007
simulated annealingbranch-and-boundinteger linear programmingspace reductionKendall-\(\tau\) distancemedian of permutations
Permutations, words, matrices (05A05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (3)
Approximate Condorcet partitioning: solving large-scale rank aggregation problems ⋮ Automedian sets of permutations: direct sum and shuffle ⋮ A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Efficient algorithms using subiterative convergence for Kemeny ranking problem
- Experiments with Kemeny ranking: What works when?
- Average parameterization and partial kernelization for computing medians
- Heuristic, branch-and-bound solver and improved space reduction for the median of permutations problem
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters
- Medians of Permutations: Building Constraints
- Parameterized Enumeration of (Locally-) Optimal Aggregations
- Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament
- Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
- NON-NULL RANKING MODELS. I
- A new rank correlation coefficient with application to the consensus ranking problem
- Reducibility among Combinatorial Problems
- Equation of State Calculations by Fast Computing Machines
- Rank Aggregation: Together We're Strong
- A NEW MEASURE OF RANK CORRELATION
- Graph Drawing
- Aggregating inconsistent information
This page was built for publication: Exploring the median of permutations problem