The following pages link to Multiple voting location problems (Q933517):
Displaying 10 items.
- Democratic elections and centralized decisions: Condorcet and approval voting compared with median and coverage locations (Q323149) (← links)
- Branch-and-bound algorithm for a competitive facility location problem (Q336436) (← links)
- Sequential competitive location on networks (Q439407) (← links)
- On the complexity of the \((r|p)\)-centroid problem in the plane (Q456933) (← links)
- The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution (Q512989) (← links)
- An exact method for the discrete \((r|p)\)-centroid problem (Q887194) (← links)
- Relaxed voting and competitive location under monotonous gain functions on trees (Q968153) (← links)
- Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree (Q1026238) (← links)
- \((r,p)\)-centroid problems on paths and trees (Q1034634) (← links)
- Local search algorithms for the problem of competitive location of enterprises (Q2261735) (← links)
