.png){kind=icon}
.png){kind=icon}
Return
Multiple voting location problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2007.08.027.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The facility voting location problems arise from the application of criteria derived from the voting processes concerning the location of facilities. The multiple location problems are those location problems in which the alternative solutions are sets of points. This paper extends previous results and notions on single voting location problems to the location of a set of facility points. The application of linear programming techniques to solve multiple facility voting location problems is analyzed. We propose an algorithm to solve Simpson multiple location problems from which the solution procedures for other problems are derived. (C) 2007 Elsevier B.V. All rights reserved.
Keywords:
voting location
condorcet
decision
location
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W