Mathematical programming formulations for the efficient solution of the \(k\)-sum approval voting problem
From MaRDI portal
Publication:1651649
DOI10.1016/j.cor.2018.05.014zbMath1394.91120arXiv1707.09225OpenAlexW2963281449WikidataQ58217104 ScholiaQ58217104MaRDI QIDQ1651649
Justo Puerto, Andrea Scozzari, Diego Ponce, Federica Ricca
Publication date: 12 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.09225
Integer programming (90C10) Continuous location (90B85) Combinatorial optimization (90C27) Voting theory (91B12) Social choice (91B14)
Related Items (5)
A comparative study of different formulations for the capacitated discrete ordered median problem ⋮ Goal programming approach for political districting in Santa Catarina state: Brazil ⋮ Constraint relaxation for the discrete ordered median problem ⋮ A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem ⋮ A branch-and-price approach for the continuous multifacility monotone ordered median problem
Cites Work
- Unnamed Item
- Unnamed Item
- Democratic elections and centralized decisions: Condorcet and approval voting compared with median and coverage locations
- Handbook on approval voting
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- On covering problems of codes
- Revisiting \(k\)-sum optimization
- Minimizing the sum of the \(k\) largest functions in linear time.
- Going from theory to practice: the mixed success of approval voting
- Approval Balloting for Multi-winner Elections
- PTAS for Minimax Approval Voting
- On the closest string and substring problems
- Introduction to Boolean Algebras
- Mathematics and Politics
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
This page was built for publication: Mathematical programming formulations for the efficient solution of the \(k\)-sum approval voting problem
