IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v110y2002i1p17-3110.1023-a1020755231275.html
   My bibliography  Save this article

An Improved Lower Bound for the Multimedian Location Problem

Author

Listed:
  • Ranganath Nuggehalli
  • Timothy Lowe
  • James Ward

Abstract

We consider the problem of locating, on a network, n new facilities that interact with m existing facilities. In addition, pairs of new facilities interact. This problem, the multimedian location problem on a network, is known to be NP-hard. We give a new integer programming formulation of this problem, and show that its linear programming relaxation provides a lower bound that is superior to the bound provided by a previously published formulation. We also report results of computational testing with both formulations. Copyright Kluwer Academic Publishers 2002

Suggested Citation

  • Ranganath Nuggehalli & Timothy Lowe & James Ward, 2002. "An Improved Lower Bound for the Multimedian Location Problem," Annals of Operations Research, Springer, vol. 110(1), pages 17-31, February.
    • Handle: RePEc:spr:annopr:v:110:y:2002:i:1:p:17-31:10.1023/a:1020755231275
    DOI: 10.1023/A:1020755231275
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1020755231275
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1020755231275?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:110:y:2002:i:1:p:17-31:10.1023/a:1020755231275. 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.