In the p-center problem, it is assumed that the facility located at a node responds to
demands originating from the node. This assumption is suitable for emergency and health …

The p-center problem (pCP) is a fundamental problem in location science, where we are
given customer demand points and possible facility locations, and we want to choose p of …

The vertex p-center problem consists in selecting p centers among a finite set of candidates
and assigning a set of clients to them, with the aim of minimizing the maximum dissimilarity …

We give a review of existing methods for solving the absolute and vertex restricted p-center
problems on networks and propose a new integer programming formulation, a tightened …

The vertex k-center problem is a classical NP-Hard optimization problem with application to
Facility Location and Clustering among others. This problem consists in finding a subset of …

New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center
problems - ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books …

Sažetak We present a polynomial time heuristic algorithm for the minimum dominating set
problem. The algorithm can readily be used for solving the minimum alpha-all-neighbor …

Large-scale unconditional and conditional vertex p p-centre problems are solved using two
meta-heuristics. One is based on a three-stage approach whereas the other relies on a …

The capacitated p-center problem requires one to select p facilities from a set of candidates
to service a number of customers, subject to facility capacity constraints, with the aim of …

Estimating covering functionals of convex bodies is an important part of Chuanming Zong's
program to attack Hadwiger's covering conjecture, which is a long-standing open problem …