Callaghan, Becky, Salhi, Said, Nagy, Gábor (2016) Drezner's exact method for the continuous p-centre problem revisited. In: Ceselli, Alberto and Cordone, Roberto and Righini, Giovanni, eds. Electronic Notes in Discrete Mathematics. 14th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW16). 55. pp. 41-44. Elsevier (doi:10.1016/j.endm.2016.10.011) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:59814)
The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
Official URL: http://dx.doi.org/10.1016/j.endm.2016.10.011 |
Abstract
Drezner's optimal algorithm for the p-centre problem is an elegant but somewhat slow method. We suggest some technical enhancements that significantly improve the method's efficiency.
Item Type: | Conference or workshop item (Paper) |
---|---|
DOI/Identification number: | 10.1016/j.endm.2016.10.011 |
Subjects: | Q Science > Operations Research - Theory |
Divisions: | Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems |
Depositing User: | Said Salhi |
Date Deposited: | 10 Jan 2017 13:09 UTC |
Last Modified: | 05 Nov 2024 10:52 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/59814 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):