Double bound method for solving the p-center location problem
Computers and Operations Research
2991 - 2999
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/20855
We give a review of existing methods for solving the absolute and vertex restricted p-center problems on networks and propose a new integer programming formulation, a tightened version of this formulation and a new method based on successive restrictions of the new formulation. A specialization of the new method with two-element restrictions obtains the optimal p-center solution by solving a series of simple structured integer programs in recognition form. This specialization is called the double bound method. A relaxation of the proposed formulation gives the tightest known lower bound in the literature (obtained earlier by Elloumi et al., ). A polynomial time algorithm is presented to compute this bound. New lower and upper bounds are proposed. Problems from the OR-Library  and TSPLIB  are solved by the proposed algorithms with up to 3038 nodes. Previous computational results were restricted to networks with at most 1817 nodes. © 2013 Elsevier Ltd.
Showing items related by title, author, creator and subject.
Calik, H.; Tansel, B. C. (Elsevier, 2013-12)We give a review of existing methods for solving the absolute and vertex restricted p-center problems on networks and propose a new integer programming formulation, a tightened version of this formulation and a new method ...
Alumur, S.A.; Kara, B.Y.; Karasan O.E. (2009)The hub location problem deals with finding the location of hub facilities and allocating the demand nodes to these hub facilities so as to effectively route the demand between any origin-destination pair. In the extensive ...
Özsoy F.A.; Pinar, M.Ç. (2006)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 ...