IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-00795-3_18.html
   My bibliography  Save this book chapter

Relevant Network Distances for Approximate Approach to Large p-Median Problems

In: Operations Research Proceedings 2012

Author

Listed:
  • Jaroslav Janacek

    (University of Zilina)

  • Marek Kvet

    (University of Zilina)

Abstract

This paper deals with the approximate approach to the large p-median problems based on the set-covering formulation. This approach pays for its shorter computational time or smaller demanded memory by losing its accuracy. The accuracy can be improved by more suitable determination of the dividing points which are used for the distance approximation. This contribution suggests that some network distances from the customers to the possible service center locations can be considered relevant, and are expected to belong to the optimal solution. We proposed to formalize the outlined notion of relevance, and based the dividing point selection on it. Hereby, we are studying the impact of the dividing point determination on the effectiveness of the presented approximate approach.

Suggested Citation

  • Jaroslav Janacek & Marek Kvet, 2014. "Relevant Network Distances for Approximate Approach to Large p-Median Problems," Operations Research Proceedings, in: Stefan Helber & Michael Breitner & Daniel Rösch & Cornelia Schön & Johann-Matthias Graf von der Schu (ed.), Operations Research Proceedings 2012, edition 127, pages 123-128, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-00795-3_18
    DOI: 10.1007/978-3-319-00795-3_18
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-319-00795-3_18. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.