DSpace

King Saud University Repository >
King Saud University >
COLLEGES >
Science Colleges >
College of Science >
College of Science >

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/3430

Title: An Enhancement of Daskin's algorithm for solving P-centre problem
Authors: Al-khedhairi, A.
Keywords: P-center
Location
0-1 Programming
Statistics
Issue Date: 21-Feb-2007
Publisher: King Saud University
Series/Report no.: College of Science - Research centre project No;Stat/2007/21
Abstract: An Enhancement to the exact algorithm of Daskin (1995) to solve the vertex P- center problem is proposed. A simple enhancement which uses tighter initial lower and upper bounds, and a more appropriate binary search method are introduced to reduce the number of subproblems to be solved. These ideas are tested on a well known set of problems from the literature (i.e., TSP-Lib problems) with encouraging results.
URI: http://hdl.handle.net/123456789/3430
Appears in Collections:College of Science

Files in This Item:

File Description SizeFormat
An Enhancement of Daskin's Algorithm for Solving P-centre.pdf117.86 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

DSpace Software Copyright © 2002-2007 MIT and Hewlett-Packard - Feedback