Skip to main content

Speeding up the optimal method of Drezner for the p-centre problem in the plane

Callaghan, Becky, Salhi, Said, Nagy, Gábor (2017) Speeding up the optimal method of Drezner for the p-centre problem in the plane. European Journal of Operational Research, 257 (3). pp. 722-734. ISSN 0377-2217. (doi:10.1016/j.ejor.2016.08.038) (KAR id:57827)

PDF Publisher pdf
Language: English

Click to download this file (1MB)
[thumbnail of Salhi Speeding up the optimal method.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format
PDF Publisher pdf
Language: English

Restricted to Repository staff only

Contact us about this Publication
[thumbnail of EJOR (pdf one submitted-original).pdf]
Official URL:


This paper revisits an early but interesting optimal algorithm first proposed by Drezner to solve the continuous p-centre problem. The original algorithm is reexamined and efficient neighbourhood reductions which are mathematically supported are proposed to improve its overall computational performance. The revised algorithm yields a considerably high reduction in computational time reaching, in some cases, a decrease of 96%. This new algorithm is now able to find proven optimal solutions for large data sets with over 1300 demand points and various values of p for the first time.

Item Type: Article
DOI/Identification number: 10.1016/j.ejor.2016.08.038
Uncontrolled keywords: Location; p-centre problem; Continuous space; Z-maximal circles; Optimal algorithm
Subjects: H Social Sciences
Divisions: Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems
Depositing User: Said Salhi
Date Deposited: 10 Oct 2016 09:20 UTC
Last Modified: 19 Sep 2023 15:03 UTC
Resource URI: (The current URI for this page, for reference purposes)
Salhi, Said:
Nagy, Gábor:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.