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. | |
| 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
problem are proposed. In the first approach modifications of some steps are introduced to reduce
the number of ILP iterations needed to find the optimal solution. In the second approach a simple
enhancement which uses tighter initial lower and upper bounds, and a more appropriate binary search
method are proposed to reduce the number of subproblems to be solved. These ideas are tested
on two well known sets of problems from the literature (i.e., OR-Lib and TSP-Lib problems) with
encouraging results
| Item Type: | Article |
|---|---|
| DOI/Identification number: | 10.1007/s10852-004-4072-3 |
| Subjects: | H Social Sciences |
| Divisions: | Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems |
| Depositing User: | Said Salhi |
| Date Deposited: | 21 Oct 2008 20:14 UTC |
| Last Modified: | 05 Nov 2024 09:37 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/5212 (The current URI for this page, for reference purposes) |
University of Kent Author Information
Salhi, Said.
| Creator's ORCID: |
 https://orcid.org/0000-0002-3384-5240
|
|---|---|
| CReDIT Contributor Roles: |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Altmetric
Altmetric
