Multiple voting location and single voting location on trees

DOI10.1016/J.EJOR.2006.06.039zbMATH Open1139.91015OpenAlexW2075055520MaRDI QIDQ877040FDOQ877040

Authors: Hartmut Noltemeier, Joachim Spoerhase, H.-C. 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

Recommendations

• How bad can a voting locating be
• Algorithms for Voting and Competitive Location on a Network
• Outcomes of voting and planning in single facility location problems
• Distance weighted voting and a single facility location problem
• Multiple voting location problems

zbMATH Keywords

facility locationgroup decisions and negotiationsCondorcetefficient graph algorithmsSimpson score

Mathematics Subject Classification ID

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

Cites Work

• Approximation algorithms for NP-hard problems.
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Title not available (Why is that?)
• On Finding the Maxima of a Set of Vectors
• Title not available (Why is that?)
• The budgeted maximum coverage problem
• The Maximum Coverage Location Problem
• Title not available (Why is that?)
• Relaxation of the Condorcet and Simpson conditions in voting location

Cited In (28)

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

This page was built for publication: Multiple voting location and single voting location on trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877040)