Double bound method for solving the p-center location problem

Simple item page
dc.citation.epage2999en_US
dc.citation.issueNumber12en_US
dc.citation.spage2991en_US
dc.citation.volumeNumber40en_US
dc.contributor.authorCalik, H.en_US
dc.contributor.authorTansel, B. C.en_US
dc.date.accessioned2016-02-08T09:36:35Z
dc.date.available2016-02-08T09:36:35Z
dc.date.issued2013en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractWe 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., [1]). A polynomial time algorithm is presented to compute this bound. New lower and upper bounds are proposed. Problems from the OR-Library [2] and TSPLIB [3] are solved by the proposed algorithms with up to 3038 nodes. Previous computational results were restricted to networks with at most 1817 nodes.en_US
dc.identifier.doi10.1016/j.cor.2013.07.011en_US
dc.identifier.eissn1873-765X
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/11693/20855
dc.language.isoEnglishen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.cor.2013.07.011en_US
dc.source.titleComputers and Operations Researchen_US
dc.subjectCovering locationen_US
dc.subjectMinimax locationen_US
dc.subjectMulti-center locationen_US
dc.subjectP-Center locationen_US
dc.subjectSet coveringen_US
dc.subjectComputational resultsen_US
dc.subjectInteger programming formulationsen_US
dc.subjectLower and upper boundsen_US
dc.subjectMinimax locationen_US
dc.subjectP-centeren_US
dc.subjectP-center problemsen_US
dc.subjectPolynomial-time algorithmsen_US
dc.subjectSet coveringsen_US
dc.subjectPolynomial approximationen_US
dc.subjectInteger programmingen_US
dc.titleDouble bound method for solving the p-center location problemen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Double_bound_method_for_solving_the_p-center_location_problem.pdf
Size:
394.61 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Department of Industrial Engineering