This study presents an endeavor to determine an optimal solution for the obnoxious facility location problem. Obnoxious materials are those which may cause harm to the health of human beings and pollute the environment. The obnoxious material management is a significant environmental issue. Since the social economical growth encourages to establishment of industrialization. While the waste mate...

Nervousness is one of those quasi-technical terms which are to be reprobated for their vagueness, but which cannot be got rid of. We refuse to admit them into strictly scientific nomenclature, but we are not able to ignore their existence. Nervousness is one of the most obnoxious as well as one of the most commonly used of these terms. It is most obnoxious, because in its pathological significa...

In the problem of obnoxious facility location, an obnoxious facility is located in an area. To maximize the social welfare, e.g., the sum of distances from all the agents to the facility, we have to get the true locations of each agent. However, each agent may misreport his/her location to stay far away from the obnoxious facility. In this paper, we design strategy-proof mechanisms on locating ...

The Obnoxious p-Median (OpM) problem is the repulsive counterpart of the more known attractive pmedian problem: given a set C of cities and a set F of possible locations for obnoxious plants, it consists in finding a p-cardinality subset of F , such that the sum of the distances between each city of C and the nearest site is maximised. Two alternative formulations for OpM and the proof of its N...

In this paper we consider several different problems of placing an obnoxious facility on geometric networks. In particular, our main results show how to obtain efficient polynomial time algorithms for locating an obnoxious facility on the given network under various distance functions such as maximizing the total sum of distances or maximizing the smallest of the distances from the facility to ...

The obnoxious center problem in a graph G asks for a location on an edge of the graph such that the minimum weighted distance from this point to a vertex of the graph is as large as possible. We derive algorithms with linear running time for the cases when G is a path or a star, thus improving previous results of Tamir. For subdivided stars we present an algorithm of running time O(n log n). Fo...

Abstract We study a continuous facility location problem on graph where all edges have unit length and the facilities may also be positioned in interior of edges. The goal is to position as many possible subject condition that any two at least distance $$\delta$$ δ from each other. investigate complexity this...