Relaxation of the Condorcet and Simpson conditions in voting location-Reference-Cited by-同舟云学术

Relaxation of the Condorcet and Simpson conditions in voting location

Published:2003-03 Issue:3 Volume:145 Page:673-683
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

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

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference14 articles.

1. The Tolerant Condorcet points;Campos;Studies in Locational Analysis,2000

2. Simpson points in planar problems with locational constraints. The polyhedral gauge case;Carrizosa;Mathematics of Operations Research,1997

3. Simpson points in planar problems with locational constraints. The round norm case;Carrizosa;Mathematics of Operations Research,1997

4. Locations with spatial interactions: Competitive locations and games;Hakimi,1990

5. Algorithms for voting and competitive location on a network;Hansen;Transportation Science,1988

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An evaluation of facility location based on the pairwise comparisons by discrete residents on a planar region;Journal of the City Planning Institute of Japan;2016

2. Optimal location of facility based on the results of voting at all paired comparisons;Journal of the City Planning Institute of Japan;2015

3. Forming Plurality at Minimum Cost;WALCOM: Algorithms and Computation;2015

4. A branch-and-cut algorithm for the discrete (r∣p)-centroid problem;European Journal of Operational Research;2013-01

5. Matheuristics and Exact Methods for the Discrete (r|p)-Centroid Problem;Metaheuristics for Bi-level Optimization;2013