Multiple voting location and single voting location on trees

Cites Work

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

Cited In (22)

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
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
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
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

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)