Locating a facility on a network with multiple median‐type objectives

R.M. Ramos, M.T. Ramos, M. Colebrook and J. Sicilia

Annals of Operations Research, 1999, vol. 86, issue 0, 235 pages

Abstract: We consider the problem of locating a single facility on a network in the presence of r >= 2median‐type objectives, represented by r sets of edge weights (or lengths)corresponding toeach of the objectives. When r=1, then one gets the classical 1‐median problem whereonly the vertices need to be considered for determining the optimal location (Hakimi [1]).The paper examines the case when r >= 2 and provides a method to determine the non‐dominatedset of points for locating the facility. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018902701712 (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:86:y:1999:i:0:p:221-235:10.1023/a:1018902701712

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

DOI: 10.1023/A:1018902701712

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 ().