Multiple voting location problems

DOI10.1016/j.ejor.2007.08.027zbMath1147.90017OpenAlexW1981416649MaRDI QIDQ933517

José A. Moreno Pérez, Clara M. Campos Rodríguez

Publication date: 21 July 2008

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

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

zbMATH Keywords

decisionlocationvoting locationcondorcet

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Discrete location and assignment (90B80)

Related Items

Democratic elections and centralized decisions: Condorcet and approval voting compared with median and coverage locations ⋮ Branch-and-bound algorithm for a competitive facility location problem ⋮ An exact method for the discrete \((r|p)\)-centroid problem ⋮ Sequential competitive location on networks ⋮ On the complexity of the \((r|p)\)-centroid problem in the plane ⋮ The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution ⋮ Relaxed voting and competitive location under monotonous gain functions on trees ⋮ Local search algorithms for the problem of competitive location of enterprises ⋮ 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

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• The \(p\)-median problem: a survey of metaheuristic approaches
• New perspectives in competitive location theory
• On locating new facilities in a competitive environment
• Relaxation of the Condorcet and Simpson conditions in voting location
• Competitive Location on a Network
• Approximation algorithms for partial covering problems
• The generalized \(p\)-centdian on network
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item