# Multiple voting location and single voting location on trees

@article{Noltemeier2007MultipleVL, title={Multiple voting location and single voting location on trees}, author={Hartmut Noltemeier and Joachim Spoerhase and Hans-Christoph Wirth}, journal={European Journal of Operational Research}, year={2007}, volume={181}, pages={654-667} }

Abstract We examine voting location problems in which the goal is to place, based on an election amongst the users, a given number of facilities in a graph. The user preference is modeled by shortest path distances in the graph. A Condorcet solution is a set of facilities to which there does not exist an alternative set preferred by a majority of the users. Recent works generalize the model to additive indifference and replaced user majority by γ -proportion. We show that for multiple voting… CONTINUE READING

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 23 CITATIONS

## A Hybrid Memetic Algorithm for the Competitive p-Median Problem

VIEW 3 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## The competitive facility location problem under disruption risks

VIEW 2 EXCERPTS

CITES BACKGROUND

## The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution

VIEW 1 EXCERPT

CITES METHODS

## A hybrid genetic algorithm with solution archive for the discrete $$(r|p)$$(r|p)-centroid problem

VIEW 2 EXCERPTS

CITES BACKGROUND

## An exact method for the discrete $$(r|p)$$(r|p)-centroid problem

VIEW 1 EXCERPT

CITES BACKGROUND