منابع مشابه
A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
This paper deals with downgrading the 1-median, i.e., changing values of parameters within certain bounds such that the optimal objective value of the location problem with respect to the new values is maximized. We suggest a game-theoretic view at this problem which leads to a characterization of an optimal solution. This approach is demonstrated by means of the Downgrading 1-median problem in...
متن کاملThe Politics of Consumption Taxes: Globalization and the Median Voter
The regressive nature of consumption taxes poses a challenge to partisan theory. Using data for up to 20 OECD countries in the period 1970-2003 this article aims to explore the question of whether the idea that social democratic governments typically have to compromise on policy goals and core constituency interests to make themselves more appealing to the median voter necessitates the use of r...
متن کاملThe Median Is the Message : toward the Fréchet Median
One could argue that the long-standing controversy over the relative merits of the median and mean is something of a touchstone of early statistics. The touchstone of medieval alchemy was basonite, a variety of quartz used to test the purity of gold alloys ; striking an alloy against the surface of the stone revealed the quality of the alloy by the color of the mark left on the stone. Likewise,...
متن کاملOn Median Graphs and Median Grid Graphs on Median Graphs and Median Grid Graphs
Let e be an edge of a median graph G which is contained in exactly one 4-cycle. Then it is proved that G n e is a median graph. The converse holds as well provided that e is not contained is a subgraph isomorphic to the 3-cube minus a vertex. These results are used to give several characterizations of median grid graphs. (Grid graphs are subgraphs of complete grids, i.e. of the Cartesian produc...
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2015
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2015.05.002