Solving the Kemeny ranking aggregation problem with quantum optimization algorithms
From MaRDI portal
Publication:6139170
DOI10.1002/mma.9489OpenAlexW4384341700MaRDI QIDQ6139170
Bernard De Baets, Raúl Pérez-Fernández, José Ranilla, Elías F. Combarro
Publication date: 16 January 2024
Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/mma.9489
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- Voting schemes for which it can be difficult to tell who won the election
- The median procedure in cluster analysis and social choice theory
- Induced binary probabilities and the linear ordering polytope: A status report
- A study of the performance of classical minimizers in the quantum approximate optimization algorithm
- Unconstrained binary models of the travelling salesman problem variants for quantum optimization
- Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem
- Handbook of social choice and welfare. Vol. 1.
- A new approach for identifying the Kemeny median ranking
- The original Borda count and partial voting
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- A Consistent Extension of Condorcet’s Election Principle
- An Axiomatic Theory of Tournament Aggregation
- Comparing Top k Lists
- Rank Aggregation: Together We're Strong
- A Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision
This page was built for publication: Solving the Kemeny ranking aggregation problem with quantum optimization algorithms
