An exact algorithm for the capacitated vertex p-center problem

Authors:
F. Aykut Özsoy;Mustafa Ç. Pinar
Affiliations:
Department of Industrial Engineering, Bilkent University, Ankara, Turkey;Department of Industrial Engineering, Bilkent University, Ankara, Turkey
Venue:
Computers and Operations Research
Year:
2006

Citing 6
Cited 2

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
Large-scale local search heuristics for the capacitated vertex p-center problem

Networks

Statistical location detection with sensor networks

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
A dual bounding scheme for a territory design problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.