Double bound method for solving the p-center location problem
Tansel, B. C.
Computers and Operations Research
2991 - 2999
MetadataShow full item record
Calik, H., & Tansel, B. C. (2013). Double bound method for solving the p-center location problem. Computers & operations research, 40(12), 2991-2999.
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/11631
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. (C) 2013 Elsevier Ltd. All rights reserved.
Showing items related by title, author, creator and subject.
Adaptive schemes for location update generation in execution location-dependent continuous queries Lam, K.-Y.; Ulusoy O. (2006)An important feature that is expected to be owned by today's mobile computing systems is the ability of processing location-dependent continuous queries on moving objects. The result of a location-dependent query depends ...
Yilmaz E.; Elbasi S.; Ferhatosmanoglu H. (Association for Computing Machinery, 2017)Deriving meaningful insights from location data helps businesses make better decisions. One critical decision made by a business is choosing a location for its new facility. Optimal location queries ask for a location to ...
Çnar, Y.; Yaman H. (2011)The vendor location problem is the problem of locating a given number of vendors and determining the number of vehicles and the service zones necessary for each vendor to achieve at least a given profit. We consider two ...