Multiple voting location and single voting location on trees

DOI10.1016/j.ejor.2006.06.039zbMath1139.91015OpenAlexW2075055520MaRDI QIDQ877040

Hartmut Noltemeier, Joachim Spoerhase, Hans-Christoph Wirth

Publication date: 19 April 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.039

zbMATH Keywords

facility locationgroup decisions and negotiationsCondorcetefficient graph algorithmsSimpson score

Mathematics Subject Classification ID

Voting theory (91B12) Discrete location and assignment (90B80) Group preferences (91B10)

Related Items

A bilevel planning model for public-private partnership ⋮ Models and algorithms for competitive facility location problems with different customer behavior ⋮ Improved algorithms for some competitive location centroid problems on paths, trees and graphs ⋮ Democratic elections and centralized decisions: Condorcet and approval voting compared with median and coverage locations ⋮ A local search heuristic for the \((r| p)\)-centroid problem in the plane ⋮ Exact method for the capacitated competitive facility location problem ⋮ Integer programming formulations for three sequential discrete competitive location problems with foresight ⋮ An exact method for the discrete \((r|p)\)-centroid problem ⋮ Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players ⋮ Sequential competitive location on networks ⋮ On the complexity of the \((r|p)\)-centroid problem in the plane ⋮ Fast metaheuristics for the discrete \((r|p)\)-centroid problem ⋮ Bilevel competitive facility location and pricing problems ⋮ Approximation of the competitive facility location problem with MIPs ⋮ The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution ⋮ A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem ⋮ Relaxed voting and competitive location under monotonous gain functions on trees ⋮ Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem ⋮ Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree ⋮ \((r,p)\)-centroid problems on paths and trees ⋮ Conditional Location Problems on Networks and in the Plane

Cites Work

• The budgeted maximum coverage problem
• Relaxation of the Condorcet and Simpson conditions in voting location
• The Maximum Coverage Location Problem
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• On Finding the Maxima of a Set of Vectors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item