Skip to main content
SpringerLink
Log in

Enhancements to Two Exact Algorithms for Solving the Vertex P-Center Problem

  • Published:
Journal of Mathematical Modelling and Algorithms

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Beasley, J. E.: A note on solving large P-median problems, European J. Oper. Res. 21 (1985), 270–273.

    Article  Google Scholar 

  2. Beasley, J. E.: OR library: Distributing test problems by electronic mail, J. Oper. Res. Soc. 41(11) (1990), 1069–1072.

    Google Scholar 

  3. Daskin, M. S.: Network and Discrete Locations: Models, Algorithms, and Applications, Wiley, New York, 1995, pp. 154–191.

    Google Scholar 

  4. Daskin, M.: A new approach to solve the vertex P-center problem to optimality: Algorithm and computational results, Comm. Oper. Res. Soc. Japan 45(9) (2000), 428–436.

    Google Scholar 

  5. Elloumi, S., Labbé, M. and Pochet, Y.: New formulation and resolution method for the P-center problem, http://www.optimization-online.org/DB.HTML/2001/10/394.html, 2001.

  6. Floyd, R.W.: Algorithm 97, Shortest Path, Comm. Assoc. Comput. Mach. 5 (1962), 345.

    Google Scholar 

  7. Hakimi, S. L.: Optimum locations of switching centers and the absolute centers and medians of a graph, Oper. Res. 12 (1964), 450–459.

    Google Scholar 

  8. Hakimi, S. L.: Optimum distribution of switching centers in a communications network and some related graph theoretic problems, Oper. Res. 13 (1965), 462–475.

    Google Scholar 

  9. Ilhan, T. and Pinar, M.C.: An efficient exact algorithm for the vertex P-center problem, http://www.optimization-online.org/DB.HTML/2001/09/376.html, 2001.

  10. Kariv, O. and Hakimi, S.: An algorithmic approach to network location problems. Part I: The P-centers, SIAM J. Appl. Math. 37 (1979), 513–538.

    Article  Google Scholar 

  11. Minieka, E.: The m-center problem, SIAM Rev. 12 (1970), 138–139.

    Article  Google Scholar 

  12. Reinelt, G.: TSPLIB – A traveling salesman problem library, ORSA J. Comput. 3 (1991), 376–384.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Management Mathematics Group, The University of Birmingham, Birmingham, B15 2TT, UK

    A. Al-khedhairi & S. Salhi

Authors
  1. A. Al-khedhairi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Salhi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Mathematics Subject Classifications (2000)

90B10, 90B80, 90C09, 90C47.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Al-khedhairi, A., Salhi, S. Enhancements to Two Exact Algorithms for Solving the Vertex P-Center Problem. J Math Model Algor 4, 129–147 (2005). https://doi.org/10.1007/s10852-004-4072-3

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10852-004-4072-3

Keywords

Search

Navigation