Double bound method for solving the p-center location problem
Tansel, B. C.
Computers and Operations Research
2991 - 2999
Item Usage Stats
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.
Integer programming formulations
Lower and upper bounds
Published Version (Please cite this version)http://dx.doi.org/10.1016/j.cor.2013.07.011
Showing items related by title, author, creator and subject.
Optimization of locating logistic supply coordination centers (LSCC) of Turkish land forces in an earthquake region Karaca, Murat (Bilkent University, 2003)This research aims at finding the optimum location of Military Logistic Supply Coordination Centers (LSCC) that are established by Turkish Land Forces for gathering and distributing the logistic supply materials among ...
Çalık, Hatice; Labbé, M.; Yaman, Hande (Springer, 2015)A p-center is a minimax solution that consists in a set of p points that minimizes the maximum distance between a demand point and a closest point belonging to that set. We present different variants of that problem. We ...
Bozkaya, B.; Tansel, B. (Elsevier, 1998)We consider the absolute p-center problem on a general network and propose a spanning tree approach which is motivated by the fact that the problem is NP-hard on general networks but solvable in polynomial time on trees. ...