|
DSpace at King Saud University >
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/10586
|
| Title: | Enhancements to Two Exact Algorithms for Solving the Vertex P-center Problem |
| Authors: | Al-khedhairi, Abdualrahman
Salhi, S |
| Keywords: | P-center, location,
0-1 Programming |
| Issue Date: | 2004 |
| Publisher: | JMMA 2(2), pp 129-147 |
| Citation: | JMMA 2(2), pp 129-147 |
| 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/10586 |
| Appears in Collections: | College of Science
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
