Özsoy, F. A.Pınar, M. Ç.2016-02-082016-02-0820060305-0548http://hdl.handle.net/11693/23804We 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.EnglishCapacitated p-center problemFacility locationInteger programmingArticle10.1016/j.cor.2004.09.0351873-765X