Analysis of 2-Opt Heuristic for the Winner Determination Problem Under the Chamberlin-Courant System
From MaRDI portal
Publication:2971639
DOI10.1007/978-3-319-53007-9_10zbMath1489.91095OpenAlexW2583602942MaRDI QIDQ2971639
Ramesh Krishnamurti, Ante Ćustić, Ehsan Iranmanesh
Publication date: 7 April 2017
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_10
Cites Work
- Unnamed Item
- Unnamed Item
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
- On the quality of local search for the quadratic assignment problem
- Domination analysis of some heuristics for the traveling salesman problem
- Proportional representation in variable-size legislatures
- On the Computation of Fully Proportional Representation
- The Complexity of Fully Proportional Representation for Single-Crossing Electorates
- Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
- Algorithms with large domination ratio