IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v111y2002i1p271-27810.1023-a1020966106259.html
   My bibliography  Save this article

On the ( r | X p )-Medianoid Problem on a Network with Vertex and Edge Demands

Author

Listed:
  • Abdullah Dasci
  • H.A. Eiselt
  • Gilbert Laporte

Abstract

This article considers the (r|X p )-medianoid problem on a network N=(V,E) with vertex and edge demands. There are already p facilities located on the network and customers patronize the closest facility. The aim is to locate r additional facilities on the network where their captured demands will be maximized. Relationships with the (r|X p )-medianoid problem with vertex demands are established. Complexity and algorithmic results are presented. Copyright Kluwer Academic Publishers 2002

Suggested Citation

  • Abdullah Dasci & H.A. Eiselt & Gilbert Laporte, 2002. "On the ( r | X p )-Medianoid Problem on a Network with Vertex and Edge Demands," Annals of Operations Research, Springer, vol. 111(1), pages 271-278, March.
  • Handle: RePEc:spr:annopr:v:111:y:2002:i:1:p:271-278:10.1023/a:1020966106259
    DOI: 10.1023/A:1020966106259
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1020966106259
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1023/A:1020966106259?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Abdullah Dasci & Gilbert Laporte, 2005. "A Continuous Model for Multistore Competitive Location," Operations Research, INFORMS, vol. 53(2), pages 263-280, April.
    2. Rafael Suárez-Vega & Dolores Santos-Peñate & Pablo Dorta-González, 2014. "Location and quality selection for new facilities on a network market," The Annals of Regional Science, Springer;Western Regional Science Association, vol. 52(2), pages 537-560, March.
    3. Kress, Dominik & Pesch, Erwin, 2012. "Sequential competitive location on networks," European Journal of Operational Research, Elsevier, vol. 217(3), pages 483-499.

    More about this item

    Keywords

    medianoid; competitive location;

    Statistics

    Access and download statistics

    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:111:y:2002:i:1:p:271-278:10.1023/a:1020966106259. 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.