Browsing by Subject "Capacitated p-center problem"
Now showing 1 - 2 of 2
Results Per Page
Sort Options
Item Open Access Algorithms for some discrete location problems(2003-09) Özsoy, F. AykutItem Open Access An exact algorithm for the capacitated vertex p-center problem(Elsevier, 2006) Özsoy, F. A.; Pınar, M. Ç.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.