The inverse 1-median problem consists in modifying the weights of the customers at
minimum cost such that a prespecified supplier becomes the 1-median of modified location …

The inverse p-median problem with variable edge lengths on graphs is to modify the edge
lengths at minimum total cost with respect to given modification bounds such that a …

This paper concerns a general inverse p-median location problem on the k-dimensional real
space where the aim is to change (increase or reduce) the weights and coordinates of the …

This paper addresses the reverse 1-center problem on a weighted tree. Here, a facility has
already been located in a predetermined node of the tree network and we want to improve …

This paper is concerned with the budget-constrained inverse median facility location
problem on networks, in which the underlying vertex set is considered as customer points …

This article considers the inverse absolute and the inverse vertex 1-center location problems
with uniform cost coefficients on a tree network T with n+ 1 vertices. The aim is to change …

This paper concerns with some variants of the inverse obnoxious median location problem
on tree networks, where the aim is either to augment or to reduce the edge lengths at the …

In this paper, we consider an inverse obnoxious p-median location problem with p≥ 2 on
trees in which the aim is to change the edge lengths at the minimum total cost so that a …

For an inverse obnoxious center location problem, the edge lengths of the underlying
network have to be changed within given bounds at minimum total cost such that a …

This paper deals with an extensive variant of the inverse p-facility maxian location problem
on networks in which the set of vertices is considered as the existing client points and the …