Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
How to allocate network centers
Journal of Algorithms
The Capacitated K-Center Problem
SIAM Journal on Discrete Mathematics
A column generation approach to capacitated p-median problems
Computers and Operations Research
A New Formulation and Resolution Method for the p-Center Problem
INFORMS Journal on Computing
Hi-index | 0.01 |
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients to them within capacity restrictions in order to minimize the maximum distance between a client and the facility to which it is assigned (capacitated p-center). The algorithm iteratively sets a maximum distance value within which it tries to assign all clients, and thus solves bin-packing or capacitated concentrator location subproblems using off-the-shelf optimization software. Computational experiments yield promising results.