Integrating heuristic information into exact methods: the case of the vertex p-centre problem

Salhi, Said and Alkhedairi, Abdulrahman (2010) Integrating heuristic information into exact methods: the case of the vertex p-centre problem. Journal of the Operational Research Society, 61 (11). pp. 1619-1631. ISSN 0160-5682. (The full text of this publication is not available from this repository)

This is the latest version of this item.

The full text of this publication is not available from this repository. (Contact us about this Publication)
Official URL
http://dx.doi.org/10.1057/jors.2009.91

Abstract

We solve the vertex p-centre problem optimally using an exact method that considers both upper and lower bounds as part of its search engine. Tight upper bounds are generated quickly via an efficient three-level heuristic, which are then used to derive potential ‘lower bounds’ accordingly. These two pieces of information when used together make our chosen exact method more efficient at obtaining optimal solutions relatively quickly. The proposed implementation produced excellent results when tested on the OR Library data set. This integrated approach can be adopted for those exact methods that consider both upper and lower bounds within their search engine and hence provide a wider spectrum of applicability in other hard combinatorial problems.

Item Type: Article
Subjects: Q Science > Operations Research - Theory
Divisions: Faculties > Social Sciences > Kent Business School > Management Science
Depositing User: Said Salhi
Date Deposited: 26 Oct 2010 15:31
Last Modified: 13 Jun 2014 11:00
Resource URI: http://kar.kent.ac.uk/id/eprint/25939 (The current URI for this page, for reference purposes)

Available versions of this item

  • Depositors only (login required):