A short note on locating facilities on a path to minimize load range equity measure

Rongbing Huang ()
Additional contact information
Rongbing Huang: York University

Annals of Operations Research, 2016, vol. 246, issue 1, No 19, 363-369

Abstract: Abstract This work considers the problem of locating $$p$$ p facilities on the nodes of a path such that the range of the weights assigned to facilities will be as small as possible. We present a polynomial progressive search algorithm to solve the problem.

Keywords: Equity; Facility location; Path partitioning (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-014-1617-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:246:y:2016:i:1:d:10.1007_s10479-014-1617-3

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

DOI: 10.1007/s10479-014-1617-3

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