Technical Note—Conditional Location Problems on Networks

Oded Berman and David Simchi-Levi
Additional contact information
Oded Berman: College of Management, University of Massachusetts, Harbor Campus, Boston, Massachusetts 02125
David Simchi-Levi: Department of Industrial Engineering and Operations Research, Columbia University, New York, New York 10027

Transportation Science, 1990, vol. 24, issue 1, 77-78

Abstract: In this paper, we describe an algorithm to solve conditional location problems (such as the conditional p -median problem or the conditional p -center problem) on networks, where demand points are served by the closest facility whether existing or new. This algorithm requires the one-time solution of a ( p + 1)-unconditional corresponding location problem using an appropriate shortest distance matrix.

Date: 1990
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.24.1.77 (application/pdf)

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:inm:ortrsc:v:24:y:1990:i:1:p:77-78

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().