IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v191y2011i1p23-3610.1007-s10479-011-0905-4.html
   My bibliography  Save this article

Improved complexity results for several multifacility location problems on trees

Author

Listed:
  • Jörg Kalcsics

Abstract

In this paper we consider multifacility location problems on tree networks. On general networks, these problems are usually NP-hard. On tree networks, however, often polynomial time algorithms exist; e.g., for the median, center, centdian, or special cases of the ordered median problem. We present an enhanced dynamic programming approach for the ordered median problem that has a time complexity of just O(ps 2 n 6 ) for the absolute and O(ps 2 n 2 ) for the node restricted problem, improving on the previous results by a factor of O(n 3 ). (n and p being the number of nodes and new facilities, respectively, and s (≤n) a value specific for the ordered median problem.) The same reduction in complexity is achieved for the multifacility k-centrum problem leading to O(pk 2 n 4 ) (absolute) and O(pk 2 n 2 ) (node restricted) algorithms. Copyright Springer Science+Business Media, LLC 2011

Suggested Citation

  • Jörg Kalcsics, 2011. "Improved complexity results for several multifacility location problems on trees," Annals of Operations Research, Springer, vol. 191(1), pages 23-36, November.
    • Handle: RePEc:spr:annopr:v:191:y:2011:i:1:p:23-36:10.1007/s10479-011-0905-4
    DOI: 10.1007/s10479-011-0905-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-011-0905-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-011-0905-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:annopr:v:191:y:2011:i:1:p:23-36:10.1007/s10479-011-0905-4. 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.