Double bound method for solving the p-center location problem
Tansel, B. C.
Computers and Operations Research
2991 - 2999
Item Usage Stats
MetadataShow full item record
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.
Balcı, Pelin (Bilkent University, 2012)This thesis aims to evaluate the locations of the existing fire stations in the city of Ankara. Vertex restricted p-center problem is solved via set covering problem and optimal locations of fire stations are found. We ...
Alumur, Sibel Alev (Bilkent University, 2009)he 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 origin–destination pairs. Hub location ...