The p-median problem with positive and negative weights has been introduced by Burkard and Krarup [Computing 60 (1998) 193]. In this paper we discuss some special cases of this problem on search procedure for general networks,which is in fact a...

Abstract Let a graph G = (V, E) with vertex set V and edge set E be given. The classical graph version of the p-median problem asks for a subset $$X\\\\subseteq V$$ of cardinality p, so that the (weighted) sum of the minimum distances from X...

Upgrading p-median problem is a problem of finding the best median of

the given graph through modification of its parameters. The current paper develops a

polynomial-time model to address this problem when the weights of vertices can...