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

Al-Khedhairi, A. and Salhi, S. (2005) Enhancements to Two Exact Methods for the Vertex P-Centre Problem. JMMA, 4 (2). pp. 129-147. ISSN 1570-1166. (The full text of this publication is not available from this repository)

The full text of this publication is not available from this repository. (Contact us about this Publication)

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
Subjects: H Social Sciences
Divisions: Faculties > Social Sciences > Kent Business School > Management Science
Depositing User: Said Salhi
Date Deposited: 21 Oct 2008 20:14
Last Modified: 06 Feb 2014 16:05
Resource URI: http://kar.kent.ac.uk/id/eprint/5212 (The current URI for this page, for reference purposes)
  • Depositors only (login required):