Sciweavers

Share
COR
2006

An exact algorithm for the capacitated vertex p-center problem

11 years 8 months ago
An exact algorithm for the capacitated vertex p-center problem
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 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 which9 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.11 2004 Published by Elsevier Ltd.
F. Aykut Özsoy, Mustafa Ç. Pinar
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where COR
Authors F. Aykut Özsoy, Mustafa Ç. Pinar
Comments (0)
books