Skip to main content

Enhancements to Two Exact Methods for the Vertex P-Centre Problem.

Al-Khedhairi, A., Salhi, Said (2005) Enhancements to Two Exact Methods for the Vertex P-Centre Problem. Journal of Mathematical Modelling and Algorithms, 4 (2). pp. 129-147. ISSN 1572-9214. (doi:10.1007/s10852-004-4072-3) (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:5212)

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. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1007/s10852-004-4072-3

Abstract

Enhancements to two exact algorithms from the literature to solve the vertex P-center

the number of ILP iterations needed to find the optimal solution. In the second approach a simple

method are proposed to reduce the number of subproblems to be solved. These ideas are tested

encouraging results

Item Type: Article
DOI/Identification number: 10.1007/s10852-004-4072-3
Subjects: H Social Sciences
Divisions: Faculties > Social Sciences > Kent Business School > Management Science
Faculties > Social Sciences > Kent Business School > Centre for Logistics and Heuristic Organisation (CLHO)
Depositing User: Said Salhi
Date Deposited: 21 Oct 2008 20:14 UTC
Last Modified: 08 Feb 2020 04:00 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/5212 (The current URI for this page, for reference purposes)
Salhi, Said: https://orcid.org/0000-0002-3384-5240
  • Depositors only (login required):