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

Abdullah Dasci, H.A. Eiselt and Gilbert Laporte

Annals of Operations Research, 2002, vol. 111, issue 1, 278 pages

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

Keywords: medianoid; competitive location (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1020966106259 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:111:y:2002:i:1:p:271-278:10.1023/a:1020966106259

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1020966106259

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().